The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
From MaRDI portal
Publication:2121020
DOI10.1007/s12095-021-00470-6zbMath1494.94051arXiv2008.09935OpenAlexW3131307612MaRDI QIDQ2121020
Publication date: 1 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.09935
Related Items
An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\), Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\), Some 3-designs and shortened codes from binary cyclic codes with three zeros, New support 5-designs from lifted linear codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
- Codes cycliques étendus affines-invariants et antichaines d'un ensemble partiellement ordonné. (Affine-invariant extended cyclic codes and antichains of a partially ordered set.)
- The dimension of projective geometry codes
- Characterization of certain minimal rank designs
- Quasi-symmetric designs, codes, quadrics, and hyperplane sections
- A coding theoretic approach to extending designs
- Linear perfect codes and a characterization of the classical designs
- Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
- On the weight distribution of second order Reed-Muller codes and their relatives
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Fundamentals of Error-Correcting Codes
- On Classifying Steiner Triple Systems by Their 3-Rank
- Designs from Linear Codes
- Bent Vectorial Functions, Codes and Designs
- New 5-designs
