The characterization of binary constant weight codes meeting the bound of Fu and Shen
From MaRDI portal
Publication:2384006
DOI10.1007/s10623-007-9049-6zbMath1138.94021OpenAlexW1989417921MaRDI QIDQ2384006
Publication date: 20 September 2007
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9049-6
Combinatorial aspects of block designs (05B05) Bounds on codes (94B65) Other designs, configurations (05B30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices
- Quasi-symmetric designs and self-dual codes
- Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
- On symmetric and quasi-symmetric designs with the symmetric difference property and their codes
- Quasi-symmetric designs, codes, quadrics, and hyperplane sections
- Quasi-symmetric designs and codes meeting the Grey-Rankin bound
- Self-complementary balanced codes and quasi-symmetric designs
- New classes of self-complementary codes and quasi-symmetric designs
- On the minimal points of positive definite quadratic forms
- Correction to 'Some Bounds for Error-Correcting Codes'
- The Closest Packing of Spherical Caps in n Dimensions
- An upper bound for binary constant weight codes
This page was built for publication: The characterization of binary constant weight codes meeting the bound of Fu and Shen