Computing coset leaders and leader codewords of binary codes
From MaRDI portal
Publication:5255749
DOI10.1142/S0219498815501285zbMath1356.94092arXiv1211.5568MaRDI QIDQ5255749
Mijail Borges-Quintana, Edgar Martínez-Moro, Irene Márquez-Corbella, Miguel Angel Borges-Trenard
Publication date: 19 June 2015
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.5568
Linear codes (general theory) (94B05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (5)
On the weak order ideal associated to linear codes ⋮ On those Boolean functions that are coset leaders of first order Reed-Muller codes ⋮ Characteristic vector and weight distribution of a linear code ⋮ Computing an Invariant of a Linear Code ⋮ Efficient representation of binary nonlinear codes: constructions and minimum distance computation
Uses Software
Cites Work
- Unnamed Item
- On the computation of coset leaders with high Hamming weight.
- Algebraic structure of the minimal support codewords set of some linear codes
- The hardness of decoding linear codes with preprocessing
- Error-Correction Capability of Binary Linear Codes
- On a Gröbner bases structure associated to linear codes
- On the inherent intractability of certain coding problems (Corresp.)
- On Correctable Errors of Binary Linear Codes
- Coset analysis of reed muller codes via translates of finite vector spaces
This page was built for publication: Computing coset leaders and leader codewords of binary codes
