21 papers · ranked by Valyu relevance
Sanjit Bhowmick
A subspace code is a nonempty collection of subspaces of the vector space F n q . A pair of linear codes is called a linear complementary pair (in short LCP) of codes if their intersection is trivial and the sum of their dimensions equals the dimension of the ambient space. Equivalently, the two codes form an LCP if…
Junfeng Jia, YanXun CHANG
Flag codes generalize constant dimension codes by considering sequences of nested subspaces with prescribed dimensions as codewords. A comprehensive construction, which unites cyclic orbit flag codes, yields two families of flag codes on F n q (where n = sk + h with s ≥ 2 and 0 ≤ h < k): optimum distance flag codes of…
Laura López-Galdo, Simon Nougaret, Demian Battaglia, Bjørg Elisabeth Kilavik
Functional multiplexing is a signature of higher-order brain regions. Beyond single-unit mixed selectivity, the six-layered cortical microcircuit has been proposed as an optimal substrate for such parallel computations. Recurrent connections within and across layers allow cortical columns to retain incoming information…
Gianira N. Alfarano, Alessandro Neri, Beatrice Toesca
We study Schubert subspace codes, which are constant-dimension subspace codes with prescribed intersection conditions with a fixed subspace. Our goal is to construct codes of maximum possible size in the extremal distance cases where a natural counting upper bound applies. We give two families of constructions. The…
Pramod Singh, Prasad Krishnan, Arti Yardi
The problem of blind identification of channel codes at a receiver involves identifying a code chosen by a transmitter from a known code-family, by observing the transmitted codewords through the channel. Most existing approaches for code-identification are contingent upon the codes in the family having some special…
Ermes Franch, Chunlei Li, Angelica Piccirillo
Spread codes are a well-known family of constant-dimension subspace-metric codes. For constant dimension $k$ and ambient space dimension $n$ being a multiple of $k$, these codes have minimum distance $2k$ and a rich geometric structure. In this paper, we study the decoding capabilities of the Nearest Neighbor Decoder…
Lyle Kingsbury, Grace Zhang, Juan Ignacio Sanguinetti-Scheck, Naoshige Uchida
The capacity to adapt behavior across different contexts is a fundamental feature of intelligence and is crucial for animal life, yet the mechanisms by which neural circuits are contextually reconfigured to alter their function are poorly understood. As a universal, ecological behavior, foraging provides a natural…
Gianira N. Alfarano, Usman Mushrraf, Ferdinando Zullo
Flag-rank-metric codes arise as a natural generalization of rank-metric codes in the context of network communication. While recent research has mainly focused on algebraic and structural properties of these codes, the combinatorial geometry underlying the flag-rank metric remains largely unexplored. In this paper, we…
Kyle Bojanek, Olivier Marre, Stephanie E. Palmer
Populations of sensory neurons are thought to be shaped by selective pressures for optimal information transmission, yet real neural circuits display substantial variability across stimulus repeats, across time, and between individuals. Reconciling this variability with normative theories requires understanding not…
Authors not listed
We present a comprehensive theoretical analysis of quantum subspace diagonalization methods for molecular electronic structure calculations, establishing rigorous complexity bounds and convergence guarantees. Building on recent developments in adaptive quantum algorithms for chemical systems, we formulate a general…
Lihong Cao
The human brain encodes a virtually infinite repertoire of semantic concepts using a finite number of neurons, a feat that defies the capacity limits of classical attractor networks. While “Concept Cells” in the medial temporal lobe (MTL) exhibit extreme sparsity, the information-theoretic principles governing their…
William Dorrell, Peter E. Latham, Timothy E. J. Behrens, James C. R. Whittington
The efficient coding hypothesis presents a compelling success story for theoretical and systems neuroscience. It marshals a unifying idea, that neural codes can be understood as efficient encodings of natural stimuli, to explain phenomena from across sensory systems, sometimes with exquisite precision. However, similar…
Willie K. Harrison, Truman Welling, Andrew Swain, Morteza Shoushtari + 1 more
Physical-layer security can aid in establishing secure telecommunication networks including cellular, Internet of Things, and telemetry networks, among others. Channel sounding techniques and/or telemetry systems for reporting channel conditions, coupled with superior wiretap code design are necessary to implement such…
Authors not listed
High-level quantum mechanical (QM) simulations provide accurate electronic information of chemical systems but scale unfavourably with system size, making calculations of applied systems challenging. Hierarchical quantum mechanics in quantum mechanics embedding (QM/QM) addresses this issue by localising the highly…
Kees Schouhamer Immink, Jos H. Weber, Tuan Thanh Nguyen, Kui Cai + 2 more
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two (or more)…
Authors not listed
The discovery of chemically novel or structurally anomalous metal-organic frameworks (MOFs) is essential for expanding reticular design space and enhancing dataset reliability. We present CHEM-AD (Chemically Unusual Metal–organic Frameworks via Autoencoder-based Detection), a label-free, CPU-efficient pipeline that…
Min Qiu, Xiaowei Wu, Peng Kang, Lei Yang + 1 more
The concept of spatial coupling is among the most significant breakthroughs in coding theory over the past decade. The excellent waterfall and error floor performance of spatially coupled codes has positioned them as promising coding candidates for future communication and data storage systems. This article presents an…
Yuhang Wang, Weihua Chen, Linjing Song, Zhiping Xu + 6 more
With the rapid growth of data volume in sensor networks, lossy source coding systems achieve high-efficiency data compression with low distortion under limited transmission bandwidth. However, conventional compression algorithms rely on a two-stage framework with high computational complexity and frequently struggle to…
Authors not listed
A framework for catalysis based on categorical aperture selection rather than temporal acceleration is presented. Traditional catalysis theory describes catalysts as agents that accelerate reactions by lowering activation energies, implicitly treating time as the fundamental variable and reaction rate enhancement as…
Authors not listed
This work establishes theoretical foundations for hierarchical quantum-classical algorithm design, where complex problems are decomposed across multiple spatial, temporal, or organizational scales with quantum and classical computation assigned to appropriate levels. We develop a mathematical framework that…
Yuwei Ma, Yingke Lei, Changming Liu, Wei Wang + 6 more
Facing heterogeneous signals increasing in dynamic spectrum, cognitive radio urgently needs blind channel coding identification. This technology addresses the core challenge of unknown coding schemes in non-cooperative communications. Existing methods are typically restricted to specific coding types and suffer from…