Equidistant frequency permutation arrays and related constant composition codes
type: Item
instance of: scholarly article
title: Equidistant frequency permutation arrays and related constant composition codes
zbMATH Open document ID: 1230.05063
author: Sophie Huczynska
published in: Designs, Codes and Cryptography
publication date: 2010-02-25T00:00:00Z
Mathematics Subject Classification ID: 05B15
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 5675127
zbMATH Keywords: optimal families of codes
MaRDI profile type: Publication
full work available at URL: s10623-009-9312-0
OpenAlex ID: W2015704121
cites work: Skolem sequences and additive permutations
cites work: Constructions for permutation codes in powerline communications
cites work: On constant composition codes
cites work: Q4873725
cites work: Combinatorial Constructions of Optimal Constant-Composition Codes
cites work: A construction of optimal constant composition codes
cites work: Q5684568
cites work: Q3942971
cites work: Frequency permutation arrays
cites work: On constant-composition codes over Z/sub q/
cites work: Constructions of binary constant-weight cyclic codes and cyclically permutable codes
cites work: Q4404774
DOI: 10.1007/S10623-009-9312-0
Recommended article: Equidistant permutation group codes
Recommended article: Diagonally neighbour transitive codes and frequency permutation arrays
Recommended article: On equidistant constant weight codes
Recommended article: Good equidistant codes constructed from certain combinatorial designs
Recommended article: Constructing constant composition codes via distance-increasing mappings
Recommended article: Decoding Frequency Permutation Arrays Under Chebyshev Distance
Recommended article: Equidistant subspace codes
Recommended article: On constant composition codes
Recommended article: Equidistant binary arithmetic codes (Corresp.)
description: scientific article; zbMATH DE number 5675127