A semigroup approach to complete decoding

DOI10.1090/CONM/642/12880MaRDI QIDQ2977866zbMATH OpenOpenAlexFDO

Authors Irene Márquez-Corbella, E. Martínez-Moro

Publication date 20 April 2017

Published in Algebra for Secure and Reliable Communication Modeling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/conm/642/12880

zbMATH Keywords

linear codessemigroupsminimal support codewordsmodular codescomplete decodingGröbner basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Heuristic decoding of linear codes using commutative algebra
• A note on linear codes over semigroup rings
• A decoding algorithm for binary linear codes using Groebner bases
• On the ideal associated to a linear code
• The syndromes decoding algorithm in group codes

Cited in

(3)

• FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments
• On the complete decoding of constrained codes
• Coset decomposition method for decoding linear codes

This page was built for publication: A semigroup approach to complete decoding

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