COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES

DOI10.1142/S0219498810003884zbMath1189.94059arXiv0909.1626OpenAlexW2964283374MaRDI QIDQ3562516

Eleonora Guerrini, Massimiliano Sala, Emmanuela Orsini

Publication date: 21 May 2010

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

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

zbMATH Keywords

Gröbner basisHamming distancenonlinear codedistance distribution

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (1)

Efficient representation of binary nonlinear codes: constructions and minimum distance computation

Uses Software

• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• On metric Ramsey-type phenomena
• The black-box complexity of nearest-neighbor search
• Gröbner Bases for the Distance Distribution of Systematic Codes
• On the Preparata and Goethals codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• The intractability of computing the minimum distance of a code
• A class of optimum nonlinear double-error-correcting codes

This page was built for publication: COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES