scientific article; zbMATH DE number 1792628

MaRDI QIDQ4552218zbMATH OpenFDO

Authors

Publication date 29 August 2002

zbMATH Keywords

decoding algorithmlinear codelinear codesmutually orthogonal Latin squaressyndrome

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
• On syndrome decoding of punctured Reed-Solomon and Gabidulin codes
• Syndrome decoding of binary-rate<tex>k/n</tex>convolutional codes
• Decoding of convolutional codes using a syndrome trellis
• On Bounded Distance Decoding for General Lattices
• Reliability-based syndrome decoding of linear block codes
• Sequential syndrome decoding of convolutional codes over large alphabets
• Syndrome decoding for Hermite codes with a Sugiyama-type algorithm
• Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
• Bounds on list decoding of MDS codes

Cited in

(3)

• A decoding algorithm for orthogonal Latin square codes
• scientific article; zbMATH DE number 1890839 (Why is no real title available?)
• Isometry invariant permutation codes and mutually orthogonal Latin squares

This page was built for publication:

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