Symmetric block designs and optimal equidistant codes
In this paper, it is shown that any symmetric block design with parameters \((v, k, \lambda)\) generates optimal ternary and quaternary constant-weight equidistant codes, whose parameters are uniquely determined by the parameters of the block design. A \(q\)-ary code is symbolwise uniform if, in the \(N \times n\) array of codewords, each nonzero symbol occurs the same number of times in each column, and this number is the same for all nonzero symbols. The paper provides constructions for certain symbolwise uniform equidistant codes of the minimum length.
- scientific article; zbMATH DE number 3438734
- Good equidistant codes constructed from certain combinatorial designs
- scientific article; zbMATH DE number 3948278
- On symmetric and quasi-symmetric designs with the symmetric difference property and their codes
- Extremal self-dual codes from symmetric designs
- scientific article; zbMATH DE number 3463505
- Binary codes and quasi-symmetric designs
- Self-complementary balanced codes and quasi-symmetric designs
- The equivalence of certain equidistant binary codes and symmetric BIBDS
- Some optimal codes from designs
- scientific article; zbMATH DE number 5963782 (Why is no real title available?)
- scientific article; zbMATH DE number 3463505 (Why is no real title available?)
- scientific article; zbMATH DE number 3438734 (Why is no real title available?)
- scientific article; zbMATH DE number 1382770 (Why is no real title available?)
- scientific article; zbMATH DE number 3410920 (Why is no real title available?)
- On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight 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
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes
- Some optimal codes from designs
- Equidistant families of sets
- Hamming weight distributions of multi-twisted codes over finite fields
- On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes
- Optimal almost equisymbol codes based on difference matrices
- scientific article; zbMATH DE number 3438734 (Why is no real title available?)
- Weakly resolvable block designs and nonbinary codes meeting the Johnson bound
- Constructions of nonbinary codes meeting the Johnson bound
- On equidistant binary codes of length \(n=4k+1\) with distance \(d=2k\)
- The equivalence of certain equidistant binary codes and symmetric BIBDS
- Good equidistant codes constructed from certain combinatorial designs
This page was built for publication: Symmetric block designs and optimal equidistant codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211176)
