Image de couverture de livre

Efficient encoding and decoding algorithm for a class of perfect single-deletion-correcting permutation codes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gao, Minhan, Shum, Kenneth W.
Format:	Preprint
Publié:	2024
Sujets:	Information Theory Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Regenerating codes with minimal disk I/O cost achieving optimal tradeoff between storage and repair bandwidth
par: Gao, Minhan, et autres
Publié: (2026)

Triprojective almost perfect nonlinear permutations and functions
par: Göloğlu, Faruk, et autres
Publié: (2026)

On perfect symmetric rank-metric codes
par: Mushrraf, Usman, et autres
Publié: (2024)

On the non-existence of perfect codes in the sum-rank metric
par: Del Prete, Giuseppe, et autres
Publié: (2025)

Decoding Trombetti-Zhou codes: a new syndrome-based decoding approach
par: Li, Chunlei, et autres
Publié: (2025)

Explicit determination of a class of permutation rational functions in any characteristic
par: Li, Yi, et autres
Publié: (2026)

Necessary and sufficient condition for constructing a single qudit insertion/deletion code and its decoding algorithm
par: Shibayama, Taro
Publié: (2025)

Algorithms of self-synchronizing single-deletion-correcting codes
par: Choi, Whan-Hyuk
Publié: (2026)

On a conjecture on APN permutations
par: Bartoli, Daniele, et autres
Publié: (2021)

On low-power error-correcting cooling codes with large distances
par: Zhao, Yuhao, et autres
Publié: (2024)

Authenticated partial correction over AV-MACs: toward characterization and coding
par: Koepke, Duncan, et autres
Publié: (2024)

The asymptotic number of equivalence classes of linear codes with given dimension
par: Di Giusto, Andrea, et autres
Publié: (2025)

When can an expander code correct $Ω(n)$ errors in $O(n)$ time?
par: Cheng, Kuan, et autres
Publié: (2023)

Equivalences of biprojective almost perfect nonlinear functions
par: Göloğlu, Faruk, et autres
Publié: (2021)

On decoding hyperbolic codes
par: Camps-Moreno, Eduardo, et autres
Publié: (2025)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

Optimal redundancy of function-correcting codes
par: Ge, Gennian, et autres
Publié: (2025)

Constructing rotatable permutations of $\mathbb{F}_{2^m}^3$ with $3$-homogeneous functions
par: Chi, Yunwen, et autres
Publié: (2024)

On extended perfect codes
par: Vorob'ev, Konstantin
Publié: (2024)

Additive codes from linear codes
par: Ball, Simeon, et autres
Publié: (2025)

Generic Reed-Solomon Codes Achieve List-decoding Capacity
par: Brakensiek, Joshua, et autres
Publié: (2022)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
par: Wang, Shuche, et autres
Publié: (2024)

Latroids and code invariants
par: Gorla, Elisa, et autres
Publié: (2025)

Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes
par: Ozbudak, Ferruh, et autres
Publié: (2024)

New upper bounds on binary linear codes and a $\mathbb Z_4$-code with a better-than-linear Gray image
par: Kiermaier, Michael, et autres
Publié: (2015)

Error-detecting solid codes
par: Carruth, Nathan Thomas
Publié: (2026)

On maximal almost balanced non-overlapping codes and non-overlapping codes with restricted run-lengths
par: Stanovnik, Lidija, et autres
Publié: (2024)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
par: Gabric, Daniel, et autres
Publié: (2026)

Focal-free uniform hypergraphs and codes
par: Huang, Xinqi, et autres
Publié: (2024)

Near optimal constructions of frameproof codes
par: Liu, Miao, et autres
Publié: (2024)

Two-weight rank-metric codes
par: Zullo, Ferdinando, et autres
Publié: (2024)

Linear rank-metric intersecting codes
par: Bartoli, Daniele, et autres
Publié: (2025)

Quasi-optimal cyclic orbit codes
par: Castello, Chiara, et autres
Publié: (2025)

Eigenvalue bounds and alternating rank-metric codes
par: Abiad, Aida, et autres
Publié: (2024)

Binary codes from subset inclusion matrices
par: Marin, Alexey D., et autres
Publié: (2024)

Optimal codes and arcs for the generalized Hamming weights
par: Kurz, Sascha, et autres
Publié: (2026)

On the existence of linear rank-metric intersecting codes
par: Borello, Martino, et autres
Publié: (2026)

Short rank-metric codes and scattered subspaces
par: Lia, Stefano, et autres
Publié: (2023)

Generalized graph codes and thier minimum distances
par: Fujii, Naoki
Publié: (2025)

On the number of inequivalent linearized Reed-Solomon codes
par: Mannaert, Jonathan, et autres
Publié: (2026)