Coding theory: the unit-derived methodology

DOI10.1504/IJICOT.2018.091852MaRDI QIDQ1993390zbMATH OpenWikidataFDO

Authors Donny Hurley, Ted Hurley

Publication date 5 November 2018

Published in International Journal of Information and Coding Theory (Search for Journal in Brave)

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

zbMATH Keywords

codedecodingunit-derived schemes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35) Other types of codes (94B60)

Abstract: The unit-derived method in coding theory is shown to be a unique optimal scheme for constructing and analysing codes. In many cases efficient and practical decoding methods are produced. Codes with efficient decoding algorithms at maximal distances possible are derived from unit schemes. In particular unit-derived codes from Vandermonde or Fourier matrices are particularly commendable giving rise to mds codes of varying rates with practical and efficient decoding algorithms. For a given rate and given error correction capability, explicit codes with efficient error correcting algorithms are designed to these specifications. An explicit constructive proof with an efficient decoding algorithm is given for Shannon's theorem. For a given finite field, codes are constructed which are `optimal' for this field.

Review text

Summary: The unit-derived method in coding theory is shown to be a unique optimal scheme for constructing and analysing codes. In many cases, efficient and practical decoding methods are produced. Codes with efficient decoding algorithms at maximal distances possible are derived from unit schemes. In particular unit-derived codes from Vandermonde or Fourier matrices are particularly commendable giving rise to MDS codes of varying rates with practical and efficient decoding algorithms. For a given rate and given error correction capability, explicit codes with efficient error correcting algorithms are designed to these specifications. An explicit constructive proof with an efficient decoding algorithm is given for Shannon's theorem. For a given finite field, codes are constructed which are `optimal' for this field.

Recommendations

• Quantum error-correcting codes: the unit design strategy
• Bounded distance decoding of unit memory codes
• scientific article; zbMATH DE number 1714666
• scientific article; zbMATH DE number 53946
• scientific article; zbMATH DE number 1486636

Cited in

(8)

• Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
• Constructions of quantum MDS codes
• Three classes of new EAQEC MDS codes
• Linear codes on unitary space
• \(l\)-LCP of codes and their applications to EAQEC codes
• New subsystem codes from matrix-product codes
• Constructions of new maximal EAQECCs from twisted group codes
• Good codes from twisted group algebras

This page was built for publication: Coding theory: the unit-derived methodology

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