Related papers: Polarization of neural codes
Progress in designing channel codes has been driven by human ingenuity and, fittingly, has been sporadic. Polar codes, developed on the foundation of Arikan's polarization kernel, represent the latest breakthrough in coding theory and have…
Recent SO(3)-equivariant models embedded a molecule as a set of single atoms fixed in the three-dimensional space, which is analogous to a ball-and-stick view. This perspective provides a concise view of atom arrangements, however, the…
In this paper, we investigate a novel family of polar codes based on multi-kernel constructions, proving that this construction actually polarizes. To this end, we derive a new and more general proof of polarization, which gives sufficient…
We investigate combinatorial, topological and algebraic properties of certain classes of neural codes. We look into a conjecture that states if the minimal \textit{open convex} embedding dimension of a neural code is two then its minimal…
Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels. Specifically, it is shown that when the input alphabet size is a prime number, a similar construction to that for…
In 2011, a topic containing the concepts of upper and lower periodic subsets of (basic) algebraic structures was introduced and studied. The concept of ``upper periodic subsets'' can be considered as a generalized topic of ideals and…
Polar codes were introduced in 2009 by Arikan as the first efficient encoding and decoding scheme that is capacity achieving for symmetric binary-input memoryless channels. Recently, this code family was extended by replacing the…
We investigate the notion of partial trace ideals, recently introduced by Maitra. We first establish several properties of partial trace ideals and give affirmative answers to questions posed by Maitra. We then study the invariant defined…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
The problem of neural coding is to understand how sequences of action potentials (spikes) are related to sensory stimuli, motor outputs, or (ultimately) thoughts and intentions. One clear question is whether the same coding rules are used…
Polar coding is a method for communication over noisy classical channels which is provably capacity-achieving and has an efficient encoding and decoding. Recently, this method has been generalized to the realm of quantum information…
Despite substantial efforts, neural network interpretability remains an elusive goal, with previous research failing to provide succinct explanations of most single neurons' impact on the network output. This limitation is due to the…
In the 1970s, O'Keefe and Dostrovsky discovered that certain neurons, called place cells, in an animal's brain are tied to its location within its arena. A combinatorial neural code is a collection of $0/1$-vectors which encode the patterns…
It is shown that polar codes achieve the symmetric capacity of discrete memoryless channels with arbitrary input alphabet sizes. It is shown that in general, channel polarization happens in several, rather than only two levels so that the…
This book is a rigorous and conceptually oriented introduction to ring theory. The emphasis is on structural understanding rather than encyclopedic coverage: rings are studied through ideals, homomorphisms, quotients, and universal…
This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…
Block full rank pencils introduced in [Dopico et al., Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems, Linear Algebra Appl., 2020] allow us to obtain local information…
The purpose of this work is to extend the study of the commutative rings whose lattice of ideals can be a structure of BL-algebra as carry out by Heubo et al in 2018, to non commutative rings appointed in the work as pseudo BL-rings. We…
We characterize the monomial ideals $I\subset K[x_1,\ldots,x_n]$ with the property that the polarization $I^p$ and $I^{\sigma^n}:=$ the ideal obtained from $I$ by the $n$-th iterated squarefree operator $\sigma$ are isomorphic via a…
In this paper we use polarization to study the behavior of the depth and regularity of a monomial ideal $I$, locally at a variable $x_i$, when we lower the degree of all the highest powers of the variable $x_i$ occurring in the minimal…