Counterexamples, Constructions, and Nonexistence Results for Optimal Ternary Cyclic Codes
Fuente:
arXiv
Guardado en:
| Autores principales: | Bao, Jingjun, Zou, Hanlin |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
por: Jeronimo, Fernando Granha, et al.
Publicado: (2025)
por: Jeronimo, Fernando Granha, et al.
Publicado: (2025)
Near-Optimal List-Recovery of Linear Code Families
por: Li, Ray, et al.
Publicado: (2025)
por: Li, Ray, et al.
Publicado: (2025)
A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
por: Schaller, Michael, et al.
Publicado: (2025)
por: Schaller, Michael, et al.
Publicado: (2025)
Optimal Erasure Codes and Codes on Graphs
por: Chen, Yeyuan, et al.
Publicado: (2025)
por: Chen, Yeyuan, et al.
Publicado: (2025)
Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
por: Yu, Wenjun, et al.
Publicado: (2025)
por: Yu, Wenjun, et al.
Publicado: (2025)
On the Construction of Recursively Differentiable Quasigroups and an Example of a Recursive $[4,2,3]_{26}$-Code
por: Klimov, Petr
Publicado: (2026)
por: Klimov, Petr
Publicado: (2026)
A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
por: Liu, Hengfeng, et al.
Publicado: (2025)
por: Liu, Hengfeng, et al.
Publicado: (2025)
New Correlation Bound and Construction of Quasi-Complementary Code Sets
por: Sarkar, Palash, et al.
Publicado: (2022)
por: Sarkar, Palash, et al.
Publicado: (2022)
Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
por: Gabrić, Daniel, et al.
Publicado: (2024)
por: Gabrić, Daniel, et al.
Publicado: (2024)
PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
por: Hollmann, Henk D. L., et al.
Publicado: (2024)
por: Hollmann, Henk D. L., et al.
Publicado: (2024)
Random Reed-Solomon Codes are List Recoverable with Optimal List Size
por: Doron, Dean, et al.
Publicado: (2024)
por: Doron, Dean, et al.
Publicado: (2024)
Bounds on Box Codes
por: Langberg, Michael, et al.
Publicado: (2025)
por: Langberg, Michael, et al.
Publicado: (2025)
Schubert Subspace Codes
por: Alfarano, Gianira N., et al.
Publicado: (2024)
por: Alfarano, Gianira N., et al.
Publicado: (2024)
Polynomials, Divided Differences, and Codes
por: Venkitesh, S.
Publicado: (2024)
por: Venkitesh, S.
Publicado: (2024)
The Eigenvalue Method in Coding Theory
por: Abiad, Aida, et al.
Publicado: (2025)
por: Abiad, Aida, et al.
Publicado: (2025)
Matroidal Entropy Functions: Constructions, Characterizations and Representations
por: Chen, Qi, et al.
Publicado: (2023)
por: Chen, Qi, et al.
Publicado: (2023)
Intersecting Codes and the Connectivity of $q$-Matroids
por: Conca, Fabrizio, et al.
Publicado: (2026)
por: Conca, Fabrizio, et al.
Publicado: (2026)
$t$-Balanced Codes with the Kendall-$τ$ Metric
por: Jany, Benjamin, et al.
Publicado: (2024)
por: Jany, Benjamin, et al.
Publicado: (2024)
The Service Rate Region of Hamming Codes
por: Choudhary, Priyanka, et al.
Publicado: (2025)
por: Choudhary, Priyanka, et al.
Publicado: (2025)
Improved Explicit Near-Optimal Codes in the High-Noise Regimes
por: Li, Xin, et al.
Publicado: (2024)
por: Li, Xin, et al.
Publicado: (2024)
Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes
por: Lo, Yuan-Hsun, et al.
Publicado: (2024)
por: Lo, Yuan-Hsun, et al.
Publicado: (2024)
Explicit Entropic Constructions for Coverage, Facility Location, and Graph Cuts
por: Iyer, Rishabh
Publicado: (2026)
por: Iyer, Rishabh
Publicado: (2026)
Maximal Recoverability: A Nexus of Coding Theory
por: Brakensiek, Joshua, et al.
Publicado: (2026)
por: Brakensiek, Joshua, et al.
Publicado: (2026)
Binary Caps and LCD Codes with Large Dimensions
por: Ishizuka, Keita, et al.
Publicado: (2026)
por: Ishizuka, Keita, et al.
Publicado: (2026)
The Geometry of Codes for Random Access in DNA Storage
por: Gruica, Anina, et al.
Publicado: (2024)
por: Gruica, Anina, et al.
Publicado: (2024)
Codes with restricted overlaps: expandability, constructions, and bounds
por: Stanovnik, Lidija
Publicado: (2024)
por: Stanovnik, Lidija
Publicado: (2024)
A Survey on Codes from Simplicial Complexes
por: Wu, Yansheng, et al.
Publicado: (2024)
por: Wu, Yansheng, et al.
Publicado: (2024)
Optimal codes and arcs for the generalized Hamming weights
por: Kurz, Sascha, et al.
Publicado: (2026)
por: Kurz, Sascha, et al.
Publicado: (2026)
Construction of CCC and ZCCS Through Additive Characters Over Galois Field
por: Ghosh, Gobinda, et al.
Publicado: (2024)
por: Ghosh, Gobinda, et al.
Publicado: (2024)
A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble
por: Guruswami, Venkatesan, et al.
Publicado: (2023)
por: Guruswami, Venkatesan, et al.
Publicado: (2023)
Improved Johnson-type Bounds for Insertion-Deletion Codes
por: Yang, Yulin
Publicado: (2026)
por: Yang, Yulin
Publicado: (2026)
Optimal Repair Bandwidth and Repair I/O of $(n,n-2,2)$ MDS Array Codes
por: Wu, Huawei
Publicado: (2026)
por: Wu, Huawei
Publicado: (2026)
On Multidimensional 2-Weight-Limited Burst-Correcting Codes
por: Berend, Hagai, et al.
Publicado: (2025)
por: Berend, Hagai, et al.
Publicado: (2025)
Whitney Numbers of Rank-Metric Lattices and Code Enumeration
por: Cotardo, Giuseppe, et al.
Publicado: (2024)
por: Cotardo, Giuseppe, et al.
Publicado: (2024)
Polynomial Invariants of q-Matroids and Rank-Metric Codes
por: Gluesing-Luerssen, Heide, et al.
Publicado: (2025)
por: Gluesing-Luerssen, Heide, et al.
Publicado: (2025)
The Support Designs of Several Families of Lifted Linear Codes
por: Ding, Cunsheng, et al.
Publicado: (2024)
por: Ding, Cunsheng, et al.
Publicado: (2024)
On Duplication-Free Codes for Disjoint or Equal-Length Errors
por: Yu, Wenjun, et al.
Publicado: (2024)
por: Yu, Wenjun, et al.
Publicado: (2024)
Universal Costas Matrices: Towards a General Framework for Costas Array Construction
por: Gulec, Fatih, et al.
Publicado: (2026)
por: Gulec, Fatih, et al.
Publicado: (2026)
Improved Rate-versus-Distance Upper Bounds for LDPC Codes
por: Shangguan, Chong, et al.
Publicado: (2026)
por: Shangguan, Chong, et al.
Publicado: (2026)
Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
por: Wang, Chen, et al.
Publicado: (2026)
por: Wang, Chen, et al.
Publicado: (2026)
Ejemplares similares
-
Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
por: Jeronimo, Fernando Granha, et al.
Publicado: (2025) -
Near-Optimal List-Recovery of Linear Code Families
por: Li, Ray, et al.
Publicado: (2025) -
A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
por: Schaller, Michael, et al.
Publicado: (2025) -
Optimal Erasure Codes and Codes on Graphs
por: Chen, Yeyuan, et al.
Publicado: (2025) -
Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
por: Yu, Wenjun, et al.
Publicado: (2025)