Minimum-weight codewords as generators of generalized Reed-Muller codes

DOI10.1109/18.868484zbMath0998.94027OpenAlexW2099206413MaRDI QIDQ2705936

Peng Ding, Jennifer D. Key

Publication date: 19 March 2001

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.868484

zbMATH Keywords

generalized Reed-Muller codeminimum-weight vectors

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (11)

Symplectic spread-based generalized Kerdock codes ⋮ Another generalisation of the binary Reed-Muller codes and its applications ⋮ On the number of \(q\)-ary quasi-perfect codes with covering radius 2 ⋮ On locally decodable codes, self-correctable codes, and \(t\)-private PIR ⋮ Minimum distance and the minimum weight codewords of Schubert codes ⋮ Small sets of even type in finite projective planes of even order ⋮ PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\) ⋮ NEW CLASS OF DOUBLE INDUCTIVE ERROR CORRECTING CODES BASED ON THE CLASS OF GRM AND DGRM CODES OVER GF(2) ⋮ Testing low-degree polynomials over prime fields ⋮ Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств ⋮ Polynomials meeting Ax’s bound

This page was built for publication: Minimum-weight codewords as generators of generalized Reed-Muller codes