Related papers: Codes from Zero-divisors and Units in Group Rings
We analyze a new group testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary thresholds. For the…
Many generator matrices for constructing extremal binary self-dual codes of different lengths have the form G=(I|A), where I is the n by n identity matrix and A is the n by n matrix fully determined by the first row. In this work, we define…
Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Perfect nonlinear monomials were employed to…
In this work, we study cyclic codes that have generators as Fibonacci polynomials over finite fields. We show that these cyclic codes in most cases produce families of maximum distance separable and optimal codes with interesting…
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…
This paper gives a construction of group divisible designs on the binary extension fields with block sizes 3, 4, 5, 6, and 7, respectively, which is motivated from the decoding of binary quadratic residue codes. A conjecture is proposed for…
In this paper, we propose to study and optimize a very general class of LDPC codes whose variable nodes belong to finite sets with different orders. We named this class of codes Hybrid LDPC codes. Although efficient optimization techniques…
Frame theory has been a popular subject in the design of structured signals and codes in recent years, with applications ranging from the design of measurement matrices in compressive sensing, to spherical codes for data compression and…
In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given.
The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…
Batch codes serve as critical tools for load balancing in distributed storage systems. While numerous constructions exist for specific batch sizes t, current methodologies predominantly rely on code dimension parameters, limiting their…
In a group trellis, the sequence of branches that split from the identity path and merge to the identity path form two normal chains. The Schreier refinement theorem can be applied to these two normal chains. The refinement of the two…
In this paper, we construct self-dual codes from a construction that involves 2x2 block circulant matrices, group rings and a reverse circulant matrix. We provide conditions whereby this construction can yield self-dual codes. We construct…
Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes…
Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…
When considering the unit group of $\mathcal{O}_F G$ ($\mathcal{O}_F$ the ring of integers of an abelian number field $F$ and a finite group $G$) certain components in the Wedderburn decomposition of $FG$ cause problems for known generic…
The notion of clean rings and 2-good rings have many variations, and have been widely studied. We provide a few results about two new variations of these concepts and discuss the theory that ties these variations to objects and properties…
We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are "symmetric" while the outputs are drawn from a…