Related papers: Generalized Weight Structure of Polar Codes: Selec…
This paper proposes new polar code design principles for the low-latency automorphism ensemble (AE) decoding. Our proposal permits to design a polar code with the desired automorphism group (if possible) while assuring the decreasing…
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…
Latroids were introduced by Vertigan, who associated a latroid to a linear block code and showed that its Tutte polynomial determines the weight enumerator of the code. We associate a latroid to a code over a ring or a field endowed with a…
We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…
Polar codes are a new family of error correction codes for which efficient hardware architectures have to be defined for the encoder and the decoder. Polar codes are decoded using the successive cancellation decoding algorithm that includes…
In this paper, we build on a recent bicategorical model called thin spans of groupoids, introduced by Clairambault and Forest. Notably, thin spans feature a decomposition of symmetry into two sub-groupoids of polarized -- positive and…
Coset constructions of $q$-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local…
The polarization process of polar codes over a ternary alphabet is studied. Recently it has been shown that the scaling of the blocklength of polar codes with prime alphabet size scales polynomially with respect to the inverse of the gap…
This paper proposes the architecture of partial sum generator for constituent codes based polar code decoder. Constituent codes based polar code decoder has the advantage of low latency. However, no purposefully designed partial sum…
In the present paper, we study deformations of polar weighted homogeneous polynomials which are also polar weighted homogeneous polynomials. We describe a round handle decomposition of the Milnor fibration of a deformation of a polar…
In this paper, we study codes with sparse generator matrices. More specifically, low-density generator matrix (LDGM) codes with a certain constraint on the weight of the columns in the generator matrix are considered. In this paper, it is…
Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with "usual" polar codes, the block error probability under successive cancellation decoding is…
We classify all $q$-ary $\Delta$-divisible linear codes which are spanned by codewords of weight $\Delta$. The basic building blocks are the simplex codes, and for $q=2$ additionally the first order Reed-Muller codes and the parity check…
This paper introduces an efficient algorithm based on the Parity-Consistent Decomposition (PCD) method to determine the WD of pre-transformed polar codes. First, to address the bit dependencies introduced by the pre-transformation matrix,…
Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. Using such…
In a recent paper Zhuoke Yang, New approaches to ${\mathfrak gl}(N)$ weight system, Izvestiya Mathematics, 2023, vol. 77:6, 150--166; arXiv:2202.12225 (2022) a construction of a weight system, which unifies ${\mathfrak gl}(N)$ weight…
One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics -…
Locally affine Lie algebras are generalizations of affine Kac--Moody algebras with Cartan subalgebras of infinite rank whose root system is locally affine. In this note we study a class of representations of locally affine algebras…
We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that…
Let $\mathfrak g$ be a classical Lie superalgebra of type I or a Cartan-type Lie superalgebra {\bf W}$(n)$. We study weight $\mathfrak g$-modules using a method inspired by Mathieu's classification of the simple weight modules with finite…