An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
From MaRDI portal
Publication:2672291
DOI10.1007/s10623-022-01032-4OpenAlexW3205470690WikidataQ114849763 ScholiaQ114849763MaRDI QIDQ2672291
Qi Liu, Can Xiang, Chun-Ming Tang
Publication date: 8 June 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.03881
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cyclic codes (94B15) Decoding (94B35) Coding theorems (Shannon theory) (94A24)
Related Items (3)
Constructions of cyclic codes and extended primitive cyclic codes with their applications ⋮ The projective general linear group \(\mathrm{PGL}(2, 5^m)\) and linear codes of length \(5^m+1\) ⋮ New infinite families of near MDS codes holding \(t\)-designs
Cites Work
- Unnamed Item
- A class of primitive BCH codes and their weight distribution
- Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
- A sequence construction of cyclic codes over finite fields
- A family of optimal ternary cyclic codes from the Niho-type exponent
- Infinite families of 2-designs and 3-designs from linear codes
- The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
- Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- Infinite families of 3-designs from a type of five-weight code
- Fundamentals of Error-Correcting Codes
- An Infinite Family of Steiner Systems from Cyclic Codes
- Designs from Linear Codes
- On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences
- Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs
- Infinite Families of Near MDS Codes Holding t-Designs
- Constructions of Self-Orthogonal Codes From Hulls of BCH Codes and Their Parameters
- An Infinite Family of Linear Codes Supporting 4-Designs
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- Optimal Ternary Cyclic Codes From Monomials
- On decoding BCH codes
This page was built for publication: An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
