Equidistant frequency permutation arrays and related constant composition codes

DOI10.1007/s10623-009-9312-0zbMath1230.05063OpenAlexW2015704121MaRDI QIDQ849359

Sophie Huczynska

Publication date: 25 February 2010

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9312-0

zbMATH Keywords

optimal families of codes

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial codes (94B25)

Related Items (6)

Increasing the minimum distance of codes by twisting ⋮ On the algebraic combinatorics of injections ⋮ Room squares with super-simple property ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications ⋮ Equidistant permutation group codes

Cites Work

• A construction of optimal constant composition codes
• Skolem sequences and additive permutations
• Constructions for permutation codes in powerline communications
• On constant composition codes
• Frequency permutation arrays
• Combinatorial Constructions of Optimal Constant-Composition Codes
• On constant-composition codes over Z/sub q/
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equidistant frequency permutation arrays and related constant composition codes