Binary Linear Codes with Near-Extremal Maximum Distance
From MaRDI portal
Publication:5138975
DOI10.1137/19M1288498zbMath1478.94128OpenAlexW3102540667MaRDI QIDQ5138975
Publication date: 4 December 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1288498
Linear codes (general theory) (94B05) Bounds on codes (94B65) Characterization theorems for permutation groups (20B10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear codes with two or three weights from quadratic bent functions
- On fixed points of elements in primitive permutation groups.
- Typical automorphism groups of finite nonrigid structures
- On permutation groups of prime power order
- On graphs with given automorphism group
- The number of finite relational structures
- Some two-weight and three-weight linear codes
- The fixity of permutation groups
- Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes
- A construction of several classes of two-weight and three-weight linear codes
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- On the Fixity of Linear Groups
- Fundamentals of Error-Correcting Codes
- Limit laws and automorphism groups of random nonrigid structures
- A Bound for the Maximum Weight of a Linear Code
- A Bound for Error-Correcting Codes
- Asymmetric graphs
- Introduction to Coding Theory
- Hadamard matrices and their applications
This page was built for publication: Binary Linear Codes with Near-Extremal Maximum Distance
