Upper bounds on permutation codes via linear programming
From MaRDI portal
Publication:1279874
DOI10.1006/eujc.1998.0272zbMath0915.94010OpenAlexW2018972846MaRDI QIDQ1279874
Publication date: 13 April 1999
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1998.0272
Linear programming (90C05) Association schemes, strongly regular graphs (05E30) Bounds on codes (94B65)
Related Items
On the construction of permutation arrays via mappings from binary vectors to permutations ⋮ A random construction for permutation codes and the covering radius ⋮ The maximum clique problem for permutation Hamming graphs ⋮ Permutation codes with specified packing radius ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ New upper bounds on the size of permutation codes under Kendall \(\tau\)-metric ⋮ Linear programming bounds for regular graphs ⋮ The covering radius of permutation designs ⋮ Semidefinite programming for permutation codes ⋮ Coding with injections ⋮ Permutation codes ⋮ Bounds on permutation codes of distance four ⋮ Invariant Semidefinite Programs ⋮ Designs in finite metric spaces: a probabilistic approach ⋮ Fundamentals of coding type problems ⋮ Study of tangle on the three qubit Werner states by using of twirl operation ⋮ A new table of permutation codes ⋮ Commutative association schemes
