Heights of error-correcting codes

DOI10.56947/GJOM.V18I2.2397MaRDI QIDQ6655384zbMATH OpenFDO

Authors Saber Darmoun, Abdelmoumen Khalid, Ben-Azza Hussain

Publication date 20 December 2024

Published in Gulf Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.56947/GJOM.V18I2.2397

zbMATH Keywords

graph spectrumheight of a linear codeminimum distancepolynomials in codes

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Codes from symmetric polynomials
• scientific article; zbMATH DE number 4200136
• scientific article; zbMATH DE number 3458474
• On some classes of optimal and near-optimal polynomial codes.
• On Tanner codes: Minimum distance and decoding

This page was built for publication: Heights of error-correcting codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655384)