Upper bounds on permutation codes via linear programming
type: Item
instance of: scholarly article
title: Upper bounds on permutation codes via linear programming
zbMATH Open document ID: 0915.94010
author: Hannu Tarnanen
published in: European Journal of Combinatorics
publication date: 1999-04-13T00:00:00Z
review text: Using linear programming, the theory of association schemes, and characters of the symmetric group on \(n\) symbols, the author derives an upper bound on the size (cardinality) of a permutation code of length \(n\) where the distance between every pair of distinct codewords comes from some specified set \(D\) of integers. Many numerical examples and tables are included.
reviewed by: Paul A. Weiner
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 1251354
zbMATH Keywords: permutation codes
zbMATH Keywords: association schemes
zbMATH Keywords: linear programming
MaRDI profile type: Publication
full work available at URL: eujc.1998.0272
OpenAlex ID: W2018972846
DOI: 10.1006/EUJC.1998.0272
description: scientific article; zbMATH DE number 1251354