24 papers · ranked by Valyu relevance
Hessam Mahdavifar, Alexander Vardy
Subspace codes were introduced by Koetter and Kschischang to correct errors and erasures in networks where topology is unknown (the noncoherent case). In this model, the codeword s are vector subspaces of a fixed ambient space; thus codes for this model are collections of such subspaces. In a previous work, we have…
Gustavo Terra Bastos, Reginaldo Palazzo Júnior, Marinês Guerreiro
In this paper we characterize the orbit codes as geometrically uniform codes. This characterization is based on the description of all isometries over a projective geometry. In addition, the Abelian orbit codes are defined and a new construction of Abelian non-cyclic orbit codes is presented. In order to analyze their…
Samin Riasat, Hessam Mahdavifar
Codes Authors: ['Samin Riasat' 'Hessam Mahdavifar'] Abstract—We propose efficient minimum-distance decoding and list-decoding algorithms for a certain class of analog subspace codes, referred to as character-polynomial (CP) codes, recently introduced by Soleymani and the second author. In particular, a CP code without…
Thierry Pierre Berger, Cheikh Thiécoumba Gueye, Jean Belo Klamti
Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode method, which leads to Alternant codes and Goppa codes over the underlying prime…
Alain Couvreur, Matthieu Lequesne
— This article discusses the security of McEliece-like encryption schemes using subspace subcodes of Reed–Solomon codes, i.e. subcodes of Reed–Solomon codes over Fqm whose entries lie in a fixed collection of Fq–subspaces of Fqm . These codes appear to be a natural generalisation of Goppa and alternant codes and…
Dean Crnković, Andrea Švob
A subspace code is a nonempty set of subspaces of a vector space F n q . Linear codes with complementary duals, or LCD codes, are linear codes whose intersection with their duals is trivial. In this paper, we introduce a notion of LCD subspace codes. We show that the minimum distance decoding problem for an LCD…
Ousmane Ndiaye, Peter Arnaud Kidoudou, Hervé Talé Kalachi
Rank-metric codes were studied by E. Gabidulin in 1985 after a brief introduction by Delsarte in 1978 as an equivalent of Reed-Solomon codes, but based on linearized polynomials. They have found applications in many areas, including linear network coding and spacetime coding. They are also used in cryptography to…
W. Jeffrey Johnston, Justin M. Fine, Seng Bum Michael Yoo, R. Becket Ebitz + 1 more
'R. Becket Ebitz' 'Benjamin Y. Hayden'] When choosing between options, we must solve an important binding problem. The values of the options must be associated with information about the action needed to select them. We hypothesize that the brain solves this binding problem through use of distinct population subspaces.…
Pablo T. Wentz, Scott L. Brincat, Anitha Pasupathy, Earl K. Miller
Cortical spiking activity in areas like prefrontal cortex (PFC) encodes information only along a small number of dimensions, a subspace of the full space of population activity patterns. PFC often uses distinct subspaces to represent incoming sensory information and to maintain it in working memory. However, it’s…
Aishwarya Parthasarathy, Cheng Tang, Roger Herikstad, Loong Fah Cheong + 2 more
'Loong Fah Cheong' 'Shih-Cheng Yen' 'Camilo Libedinsky'] Maintenance of working memory is thought to involve the activity of prefrontal neuronal populations with strong recurrent connections. However, it was recently shown that distractors evoke a morphing of the prefrontal population code, even when memories are…
Wenjiao Xie, Huisheng Zhang, Yingjie Jay Guo
We propose a novel slot-pattern-control based coded compressed sensing for unsourced random access with an outer A-channel code capable of correcting t errors. Specifically, an RM extension code called patterned Reed-Muller (PRM) code is proposed. We demonstrate the high spectral efficiency due to its enormous sequence…
Francisco Revson F. Pereira, Stefano Mancini, Giuliano G. La Guardia
The Lindblad master equation describes the evolution of a large variety of open quantum systems. An important property of some open quantum systems is the existence of decoherence-free subspaces. A quantum state from a decoherence-free subspace will evolve unitarily. However, there is no procedural and optimal method…
Valéria G. Pedrosa, Max H. M. Costa, Sangun Park
The index coding problem consists of a system with a server and multiple receivers with different side information and demand sets, connected by a noiseless broadcast channel. The server knows the side information available to the receivers. The objective is to design an encoding scheme that enables all receivers to…
Eric Elmoznino, Michael F. Bonner
Geometric descriptions of deep neural networks (DNNs) have the potential to uncover core principles of computational models in neuroscience, while abstracting over the details of model architectures and training paradigms. Here we examined the geometry of DNN models of visual cortex by quantifying the latent…
Daniel Calabuig, Francisco J. González-Castaño
This paper analyzes the relationship between pilot symbol-assisted modulation (PSAM) and unitary space-time modulation (USTM). In particular, we present a map that transforms any PSAM into a USTM and vice versa. USTMs are known to be capacity-achieving. However, most of the proposed USTM construction methods in the…
Arni Sturluson, Melanie T. Huynh, Arthur H. P. York, Cory Simon
Porous organic cage molecules harbor nano-sized cavities that can selectively adsorb gas molecules, lending them applications in separations and sensing. The geometry of the cavity strongly influences adsorptive selectivity.For comparing cages and predicting their adsorption properties, we embed/ encode the cavities of…
Arni Sturluson, Melanie T. Huynh, Arthur H. P. York, Cory Simon
Porous organic cage molecules harbor nano-sized cavities that can selectively adsorb gas molecules, lending them applications in separations and sensing. The geometry of the cavity strongly influences adsorptive selectivity.For comparing cages and predicting their adsorption properties, we embed/ encode the cavities of…
Arni Sturluson, Melanie T. Huynh, Arthur H. P. York, Cory Simon
Porous organic cage molecules harbor nano-sized cavities that can selectively adsorb gas molecules, lending them applications in separations and sensing. The geometry of the cavity strongly influences their adsorptive selectivity. For comparing cages and predicting their adsorption properties, we embed/encode a set of…
Junbin Fang, Zhengzhong Yi, Jin Li, Zhipeng Liang + 4 more
'Wen Lei' 'Zoe Lin Jiang' 'Xuan Wang'] Combined with one-time pad encryption scheme, quantum key distribution guarantees the unconditional security of communication in theory. However, error correction and privacy amplification in the post-processing phase of quantum key distribution result in high time delay, which…
W. Jeffrey Johnston, Stephanie E. Palmer, David J. Freedman
Neuronal activity in the brain is variable, yet both perception and behavior are generally reliable. How does the brain achieve this? Here, we show that the conjunctive coding of multiple stimulus features, commonly known as nonlinear mixed selectivity, may be used by the brain to support reliable information…
Nickolas Gantzler, Adrian Henle, Praveen Thallapally, Xiaoli Fern + 1 more
A gravimetric, MOF-based (MOF = metal-organic framework) sensor array functions by measuring the mass of gas adsorbed in an array of MOFs. Changes in the gas composition are expected to produce detectable changes in the mass of gas adsorbed in the MOFs. In practical settings, multiple components of the gas adsorb into…
Authors not listed
This work provides a rigorous theoretical investigation of selective error correction strategies for variational quantum algorithms, with focus on understanding the interplay between error suppression, circuit trainability, and computational resource requirements. We develop a mathematical framework that characterizes…
Authors not listed
The Hidden Subgroup Problem (HSP) unifies several landmark quantum algorithms, yet systematic exploration of its variants and modern applications has slowed. This paper revives HSP-based algorithm design by examining new group structures with direct relevance to post-quantum cryptography, lattice problems, and…
Ian Holmes
We describe a strategy for constructing codes for DNA-based information storage by serial composition of weighted finite-state transducers. The resulting state machines can integrate correction of substitution errors; synchronization by interleaving watermark and periodic marker signals; conversion from binary to…