A new combinatorial approach to the construction of constant composition codes (Q931533): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11425-008-0036-9 / rank
Normal rank
 
Property / author
 
Property / author: Yu. Tang / rank
Normal rank
 
Property / author
 
Property / author: Yu. Tang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11425-008-0036-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1894601137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constant-composition codes over Z/sub q/ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds and constructions for ternary constant-composition codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constant composition codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Constructions of Constant Composition Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Constructions of Optimal Constant-Composition Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A construction of optimal constant composition codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Family of Optimal Constant-Composition Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of ternary constant-composition codes with weight three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing designs with equal-sized holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal constant weight codes over \(Z_k\) and generalized designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum distance holey packings and related codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on maximum distance holey packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The PBD-Closure of Constant-Composition Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11425-008-0036-9 / rank
 
Normal rank

Latest revision as of 08:34, 10 December 2024

scientific article
Language Label Description Also known as
English
A new combinatorial approach to the construction of constant composition codes
scientific article

    Statements

    A new combinatorial approach to the construction of constant composition codes (English)
    0 references
    0 references
    0 references
    25 June 2008
    0 references
    The main purpose of this paper is to introduce a feasible combinatorial approach to obtain optimal constant composition codes which are generalization of binary constant weight codes. The approach followed is different from the known ones used in the constructions of constant composition codes (CCCs). The construction uses the notion of a transversal design. The authors have illustrated the application of this approach to two types of optimal CCCs also. The approach taken in this paper may result in some more types of optimal CCCs.
    0 references
    constant composition codes
    0 references
    binary constant weight codes
    0 references
    optimal constant
    0 references
    composition codes
    0 references
    combinatorial design
    0 references

    Identifiers