Constructions for q-Ary Constant-Weight Codes
From MaRDI portal
Constructions for $q$-Ary Constant-Weight Codes
Abstract: This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary constant-weight codes and sets of pairwise disjoint combinatorial designs of various types.
Recommendations
- A new construction for \(q\)-ary constant weight codes
- Optimal constant weight codes over \(Z_k\) and generalized designs
- On the constructions of constant-weight codes
- Constructions of a class of optimal constant composition codes
- Constructions of optimal quaternary constant weight codes via group divisible designs
Cited in
(28)- Constructions of cyclic quaternary constant-weight codes of weight three and distance four
- Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes
- A construction of group divisible designs with block sizes 3 to 7
- One-weight codes in some classes of group rings
- The completion of optimal cyclic quaternary codes of weight 3 and distance 3
- On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes
- Two-weight codes: upper bounds and new optimal constructions
- Hanani triple packings and optimal \(q\)-ary codes of constant weight three
- Completely reducible super-simple designs with block size four and related super-simple packings
- Construction of perfect \(q\)-ary codes by switchings of simple components
- scientific article; zbMATH DE number 2127873 (Why is no real title available?)
- On the Kronecker Product Construction of Completely Transitive q-Ary Codes
- A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb F_p[u]/\langle u^m\rangle\)
- Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
- 4-\({}^{\ast}\text{GDD}(6^n)\)s and related optimal quaternary constant-weight codes
- Completely reducible super-simple designs with block size five and index two
- A note on optimal constant dimension codes
- scientific article; zbMATH DE number 6796356 (Why is no real title available?)
- A pair of disjoint 3-gdds of type \(g^{t} u^{1}\)
- A family of diameter perfect constant-weight codes from Steiner systems
- A new construction for \(q\)-ary constant weight codes
- On the Construction of Multiply Constant-Weight Codes
- Constructions of optimal multiply constant-weight codes MCWC(3,n₁; 1,n₂; 1,n₃; 8)s
- On a class of optimal constant weight codes
- Approximate generalized Steiner systems and near-optimal constant weight codes
- Asymptotically optimal constant weight codes with even distance
- Levenshtein's sequence reconstruction problem and results for larger alphabet sizes
- Tilings of \(\mathcal{H}_q(n,w)\) with optimal \((n,d,w)_q\)-codes
This page was built for publication: Constructions for $q$-Ary Constant-Weight Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548122)
