Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
From MaRDI portal
Publication:948688
DOI10.1016/j.dam.2007.10.028zbMath1148.05023OpenAlexW2094432171MaRDI QIDQ948688
Publication date: 17 October 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.10.028
constant composition codesCCCconstructions of GDRPsGDRPgeneralized doubly resolvable packingsoptimal CCCs
Related Items (9)
On generalized Howell designs with block size three ⋮ Generalized balanced tournament designs with block size four ⋮ Room squares with super-simple property ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ Two series of equitable symbol weight codes meeting the Plotkin bound ⋮ Asymptotic existence of frame-GBTDs ⋮ Generalized balanced tournament designs and related codes ⋮ A class of optimal constant composition codes from GDRPs ⋮ Near generalized balanced tournament designs with block sizes 4 and 5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of optimal constant composition codes
- Frames for Kirkman triple systems
- Constructions for generalized balanced tournament designs
- Constructions for permutation codes in powerline communications
- On constant composition codes
- Frequency permutation arrays
- Generalized Balanced Tournament Designs
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Algebraic Constructions of Constant Composition Codes
- Combinatorial Constructions of Optimal Constant-Composition Codes
- On constant-composition codes over Z/sub q/
- Bounds and constructions for ternary constant-composition codes
- Construction of Room Squares
This page was built for publication: Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
