27 papers · ranked by Valyu relevance
Haiteng Liu, Thomas Honold
—Subspace codes form the appropriate mathematical setting for investigating the Koetter-Kschischang model of fault-tolerant network coding. The Main Problem of Subspace Coding asks for the determination of a subspace code of maximum size (proportional to the transmission rate) if the remaining parameters are kept…
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…
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…
Tuvi Etzion, Antonia Wachter-Zeh
—This paper considers vector network coding solutions based on rank-metric codes and subspace codes. The main result of this paper is that vector solutions can significantly reduce the required alphabet size compared to the optimal scalar linear solution for the same multicast network. The multicast networks considered…
Dean Crnković, Keita Ishizuka, Hadi Kharaghani, Sho Suda + 1 more
'Andrea Švob'] Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing self-orthogonal and LCD subspace codes from a set of matrices under…
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…
Chao Chen, Hongmei Xie, Baoming Bai
Subspace codes were introduced by K¨otter and Kschischang for error control in random linear network coding. In this paper, a layered type of subspace codes is considered, which can be viewed as a superposition of multiple component subspace codes. Exploiting the layered structure, we develop two decoding algorithms…
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.…
Andrea K Barreiro, Antonio J Fontenele, Cheng Ly, Prashant Raju + 2 more
As information about the world is conveyed from the sensory periphery to central neural circuits, it mixes with complex ongoing cortical activity. How do neural populations keep track of sensory signals, separating them from noisy ongoing activity? Here we show that sensory signals are encoded more reliably in certain…
Justin M. Fine, Seng Bum Michael Yoo, R. Becket Ebitz, Benjamin Y. Hayden
To choose between options, we must solve two important binding problems. First, the features that determine each options’ values must be appropriately combined and kept separate from the corresponding features of other options. Second, options must be associated with the specific actions needed to select them. We…
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…
David Hunn, Willie K. Harrison
A new method is explored for analyzing the performance of coset codes over the binary erasure wiretap channel (BEWC) by decomposing the code over subspaces of the code space. This technique leads to an improved algorithm for calculating equivocation loss. It also provides a continuous-valued function for equivocation…
Yaara Erez, Mikiko Kadohisa, Philippe Petrov, Natasha Sigala + 3 more
Complex neural dynamics in the prefrontal cortex contribute to context-dependent decisions and attentional competition. To analyze these dynamics, we apply demixed principal component analysis to activity of a primate prefrontal cell sample recorded in a cued target detection task. The results track dynamics of cue and…
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…
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…
Ulises Pereira-Obilinovic, Kayvon Daie, Susu Chen, Karel Svoboda + 1 more
Most behaviors involve neural dynamics in high-dimensional activity spaces. A common approach is to extract dimensions that capture task-related variability, such as those separating stimuli or choices, yielding low-dimensional, task-aligned neural activity subspaces (“coding dimensions”). However, whether these…
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…
Aishwarya Parthasarathy, Cheng Tang, Roger Herikstad, Loong Fah Cheong + 2 more
Endogenous processes allow the maintenance of working memories. These processes presumably involve prefrontal networks with strong recurrent connections. Distractors evoke a morphing of the population code, even when memories are stable. But it is unclear whether these dynamic population responses contain stable memory…
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…
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…
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…
Erdal Arıkan
Polarization adjusted convolutional (PAC) codes are a class of codes that combine channel polarization with convolutional coding. PAC codes are of interest for their high performance. This paper presents a systematic encoding and shortening method for PAC codes. Systematic encoding is important for lowering the…
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…
Denice van Herwerden, Alexandros Nikolopoulos, Leon Barron, Jake O'Brien + 3 more
- 1. Van 't Hoff Institute for Molecular Sciences (HIMS), University of Amsterdam, Amsterdam - 2. MRC Centre for Environment and Health, Environmental Research Group, School of Public Health, Faculty of Medicine, Imperial College London, W12 0BZ, United Kingdom - 3. Queensland Alliance for Environmental Health Sciences…
Imanol Granada, Pedro M. Crespo, Javier Garcia-Frías
In this paper, we look at the problem of implementing high-throughput Joint Source- Channel (JSC) coding schemes for the transmission of binary sources with memory over AWGN channels. The sources are modeled either by a Markov chain (MC) or a hidden Markov model (HMM). We propose a coding scheme based on the…