Optimal binary constant weight codes and affine linear groups over finite fields
From MaRDI portal
Publication:1999901
DOI10.1007/s10623-018-0581-3zbMath1412.94245arXiv1707.02315OpenAlexW2963005912WikidataQ128887802 ScholiaQ128887802MaRDI QIDQ1999901
Publication date: 27 June 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.02315
Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25) Group actions on combinatorial structures (05E18)
Related Items (2)
Optimal binary constant weight codes and affine linear groups over finite fields ⋮ The Möbius function of the affine linear group \(\text{AGL }(1,\mathbb{F}_q)\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From planar nearrings to generating blocks
- Some new distance-4 constant weight codes
- 3-designs from \(\text{PSL}(2,q)\)
- Optimal binary constant weight codes and affine linear groups over finite fields
- \(3\)-designs from PGL\((2,q)\)
- A new table of constant weight codes of length greater than 28
- Upper bounds for constant-weight codes
- A new table of constant weight codes
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- On the Applications of Mobius Inversion in Combinatorial Analysis
- Fundamentals of Error-Correcting Codes
- Some sequences of optimal constant weight codes
- Classification of Binary Constant Weight Codes
- New Constant-Weight Codes From Propagation Rules
This page was built for publication: Optimal binary constant weight codes and affine linear groups over finite fields
