Efficient representation of binary nonlinear codes: constructions and minimum distance computation
From MaRDI portal
Publication:2350921
DOI10.1007/s10623-014-0028-4zbMath1346.94153MaRDI QIDQ2350921
Mercè Villanueva, Fanxuan Zeng, Jaume Pujol
Publication date: 25 June 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: http://ddd.uab.cat/record/142404
Related Items
On decoding procedures of intertwining codes, Comparing decoding methods for quaternary linear codes, Generating nonlinear codes for multi-bit symbol error correction using cellular automata, Parity check systems of nonlinear codes over finite commutative Frobenius rings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic techniques for nonlinear codes
- \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality
- A method for efficiently computing the number of codewords of fixed weights in linear codes
- On perfect \(p\)-ary codes of length \(p+1\)
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- Two new four-error-correcting binary codes
- Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
- An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm
- Searching for linear codes with large minimum distance
- COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- The intractability of computing the minimum distance of a code
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- Fundamentals of Error-Correcting Codes
- The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
- Computing coset leaders and leader codewords of binary codes
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
