Minimal and optimal binary codes obtained using C_D-construction over the non-unital ring I
From MaRDI portal
Publication:6146594
Abstract: In this article, we construct linear codes over the commutative non-unital ring of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are minimal and self-orthogonal. All codes in this article are few-weight codes. Besides, an infinite class of these binary codes consists of distance optimal codes with respect to the Griesmer bound.
The article under review studies linear codes over the commutative non-unital ring \(I\) (according to the classification from [\textit{B. Fine}, Math. Mag. 66, No. 4, 248--252 (1993; Zbl 0838.16011)] of size four. The codes studied arise from the \(C_D\) construction introduced in [\textit{C. Ding} et al., IEEE Trans. Inf. Theory 53, No. 6, 2229--2235 (2007; Zbl 1310.94178)], where \(D\) is a simplicial complex over \(\mathbb{F}_2^m\). The authors compute the Lee weight distribution of these codes, and they study their binary Gray images. Using this knowledge, they obtain conditions for these images to be self-orthogonal, 1-weight, 2-weight, minimal, or optimal with respect to the Griesmer bound.
Recommendations
- Certain binary minimal codes constructed using simplicial complexes
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- Self-orthogonal codes over a non-unital ring from two class association schemes
- Self-orthogonal codes over a non-unital ring and combinatorial matrices
- New classes of binary few weight codes from trace codes over a chain ring
Cites work
- A Bound for Error-Correcting Codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A Generic Construction of Cartesian Authentication Codes
- Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction
- Classification of Finite Rings of Order p<sup>2</sup>
- Codes for error detection.
- Construction of quasi self-dual codes over a commutative non-unital ring of order 4
- Constructions of Self-Orthogonal Codes From Hulls of BCH Codes and Their Parameters
- DNA codes over two noncommutative rings of order four
- Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u]\)-additive codes from down-sets
- FEW-WEIGHT CODES FROM TRACE CODES OVER
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- Few-weight quaternary codes via simplicial complexes
- Five-weight codes from three-valued correlation of M-sequences
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3894973 (Why is no real title available?)
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- LCD and ACD codes over a noncommutative non-unital ring with four elements
- Linear codes from simplicial complexes
- Minimal vectors in linear codes
- New classes of binary few weight codes from trace codes over a chain ring
- Nonbinary quantum stabilizer codes
- Octanary linear codes using simplicial complexes
- On Hulls of Some Primitive BCH Codes and Self-Orthogonal Codes
- Optimal Few-Weight Codes From Simplicial Complexes
- Optimal minimal linear codes from posets
- Quantum error correction via codes over GF(4)
- Quasi type IV codes over a non-unital ring
- Quaternary Linear Codes and Related Binary Subfield Codes
- Searching for linear codes with large minimum distance
- Secret sharing schemes from three classes of linear codes
- Self-orthogonal codes over a non-unital ring and combinatorial matrices
- The build-up construction of quasi self-dual codes over a non-unital ring
- The build-up construction over a commutative non-unital ring
- The Geometry of Two-Weight Codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Two families of two-weight codes over \(\mathbb{Z}_4\)
- Type II codes over F/sub 2/+uF/sub 2/
- Type IV codes over a non-unital ring
- Type IV self-dual codes over rings
- Weights of linear codes and strongly regular normed spaces
Cited in
(6)- Certain binary minimal codes constructed using simplicial complexes
- Subfield codes of \(C_D\)-codes over \(\mathbb{F}_2 [x] / \langle x^3 - x \rangle\)
- The weight distributions and weight hierarchies of two classes of few-weight linear codes
- Binary subfield codes of codes over a certain chain ring
- Binary t-divisible codes via simplicial complexes and their applications
- Hamming weight enumerators and hulls of linear codes with new parameters associated with simplicial complexes
This page was built for publication: Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146594)
