Minimal and optimal binary codes obtained using C_D-construction over the non-unital ring I

DOI10.1007/S10623-023-01299-1arXiv2305.08781MaRDI QIDQ6146594FDOQ6146594

Authors: Vidya Sagar, Ritumoni Sarma 

Publication date: 15 January 2024

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: In this article, we construct linear codes over the commutative non-unital ring $I$ 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.

Full work available at URL: https://arxiv.org/abs/2305.08781

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

zbMATH Keywords

simplicial complexself-orthogonal codeoptimal codeminimal codenon-unital ringfew-weight code

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Linear codes (general theory) (94B05) Noncommutative local and semilocal rings, perfect rings (16L30)

Cites Work

• Codes for error detection.
• Searching for linear codes with large minimum distance
• The Geometry of Two-Weight Codes
• Secret sharing schemes from three classes of linear codes
• Fundamentals of Error-Correcting Codes
• Title not available (Why is that?)
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Nonbinary quantum stabilizer codes
• Quantum error correction via codes over GF(4)
• Minimal vectors in linear codes
• Type II codes over F/sub 2/+uF/sub 2/
• Title not available (Why is that?)
• A Bound for Error-Correcting Codes
• Weights of linear codes and strongly regular normed spaces
• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
• A Generic Construction of Cartesian Authentication Codes
• Optimal Few-Weight Codes From Simplicial Complexes
• Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
• Type IV self-dual codes over rings
• Classification of Finite Rings of Order p²
• Linear codes from simplicial complexes
• Octanary linear codes using simplicial complexes
• Quaternary Linear Codes and Related Binary Subfield Codes
• Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction
• 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 and combinatorial matrices
• Quasi type IV codes over a non-unital ring
• Type IV codes over a non-unital ring
• Constructions of Self-Orthogonal Codes From Hulls of BCH Codes and Their Parameters
• Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u]\)-additive codes from down-sets
• FEW-WEIGHT CODES FROM TRACE CODES OVER
• The build-up construction over a commutative non-unital ring
• The build-up construction of quasi self-dual codes over a non-unital ring
• Optimal minimal linear codes from posets
• Few-weight quaternary codes via simplicial complexes
• New classes of binary few weight codes from trace codes over a chain ring
• DNA codes over two noncommutative rings of order four
• Two families of two-weight codes over \(\mathbb{Z}_4\)
• LCD and ACD codes over a noncommutative non-unital ring with four elements
• On Hulls of Some Primitive BCH Codes and Self-Orthogonal Codes
• Five-weight codes from three-valued correlation of M-sequences
• Construction of quasi self-dual codes over a commutative non-unital ring of order 4

Cited In (2)

• Certain binary minimal codes constructed using simplicial complexes
• Subfield codes of \(C_D\)-codes over \(\mathbb{F}_2 [x] / \langle x^3 - x \rangle\)

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)