New upper bounds for the size of permutation codes via linear programming
From MaRDI portal
Publication:612914
zbMath1204.05030MaRDI QIDQ612914
Publication date: 16 December 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/233087
Linear programming (90C05) Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items
The maximum clique problem for permutation Hamming graphs, Permutation codes with specified packing radius, On the algebraic combinatorics of injections, Semidefinite programming for permutation codes, A new table of permutation codes
Uses Software