nach oben

Designs, Codes and Cryptography

Erschienen in:

06.12.2023

Improved bounds for permutation arrays under Chebyshev distance

verfasst von: Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf, I. Hal Sudborough

Erschienen in: Designs, Codes and Cryptography | Ausgabe 4/2024

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Permutation arrays under the Chebyshev metric have been considered for error correction in noisy channels. Let P(n, d) denote the maximum size of any array of permutations on n symbols with pairwise Chebyshev distance d. We give new techniques and improved upper and lower bounds on P(n, d), including a precise formula for P(n, 2).

Vorheriger Artikel On the equivalence of -linear generalized Hadamard codes

Nächster Artikel Jacobi polynomials and harmonic weight enumerators of the first-order Reed–Muller codes and the extended Hamming codes

Bereg S., Bumpass W., Haghpanah M., Malouf B., Sudborough I.H.: Bounds for permutation arrays under Kendall tau metric. arXiv:2301.11423 (2023)

Bereg S., Levy A., Sudborough I.H.: Constructing permutation arrays from groups. Des. Codes Cryptogr. 86, 1095–1111 (2018). https://doi.org/10.1007/s10623-017-0381-1.MathSciNetCrossRef

Bereg S., Miller Z., Mojica L.G., Morales L., Sudborough I.H.: New lower bounds for permutation arrays using contraction. Des. Codes Cryptogr. 87, 2105–2128 (2019).MathSciNetCrossRef

Buzaglo S., Etzion T.: Bounds on the size of permutation codes with the Kendall \(\tau \)-metric. IEEE Trans. Inform. Theory 61, 3241–3250 (2015).MathSciNetCrossRef

Chu W., Colbourn C.J., Dukes P.: Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32, 51–64 (2004).MathSciNetCrossRef

Deza M.M., Huang T.: Metrics on permutations, a survey. J. Comb. Inf. Syst. Sci. 23, 173–185 (1998).MathSciNet

Hagberg A.A., Schult D.A., Swart P.J.: Exploring network structure, dynamics, and function using networkx. In: Proceedings of the 7th Python in Science Conference SciPy2008, pp. 11–15 (2008).

Jiang A., Schwartz M., Bruck J.: Correcting charge-constrained errors in the rank-modulation scheme. IEEE Trans. Inform. Theory 56, 2112–2120 (2010).MathSciNetCrossRef

Kløve T.: Lower bounds on the size of spheres of permutations under the Chebyshev distance. Des. Codes Cryptogr. 59, 183–191 (2011).MathSciNetCrossRef

10.

Kløve T., Lin T.-T., Tsai S.-C., Tzeng W.-G.: Permutation arrays under the Chebyshev distance. IEEE Trans. Inf. Theory 56, 2611–2617 (2010).MathSciNetCrossRef

11.

Rossi R.A., Gleich D.F., Gebremedhin A.H., Patwary M.M.: A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components. arXiv:1302.6256 (2013)

Titel: Improved bounds for permutation arrays under Chebyshev distance
verfasst von: Sergey Bereg
Mohammadreza Haghpanah
Brian Malouf
I. Hal Sudborough
Publikationsdatum: 06.12.2023
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 4/2024
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-023-01326-1

Springer Professional

Improved bounds for permutation arrays under Chebyshev distance

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 4/2024

Mutually disjoint Steiner systems from BCH codes

Provable lattice reduction of with blocksize n/2

On the equivalence of -linear generalized Hadamard codes

Jacobi sums over Galois rings of arbitrary characters and their applications in constructing asymptotically optimal codebooks

-Almost collision-flat universal hash functions and mosaics of designs

Hulls of linear codes from simplex codes

Premium Partner