A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
Fuente:
arXiv
Guardado en:
| Autores principales: | Liu, Hengfeng, Tang, Chunming, Zhou, Zhengchun, Han, Dongchun, Chen, Hao |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A Further Investigation on Complete Complementary Codes from $q$-ary Functions
por: Sarkar, Palash, et al.
Publicado: (2024)
por: Sarkar, Palash, et al.
Publicado: (2024)
Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes
por: Liu, Hengfeng, et al.
Publicado: (2025)
por: Liu, Hengfeng, et al.
Publicado: (2025)
The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
por: Liang, Xue-Bin
Publicado: (2024)
por: Liang, Xue-Bin
Publicado: (2024)
Rank Distribution and Dynamics of Gram Matrices from Binary m-Sequences with Applications to LCD Codes
por: Liu, Hengfeng, et al.
Publicado: (2026)
por: Liu, Hengfeng, et al.
Publicado: (2026)
Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
por: Gabrić, Daniel, et al.
Publicado: (2024)
por: Gabrić, Daniel, et al.
Publicado: (2024)
Digit-Indexed q-ary SEC-DED Codes with Near-Hamming Overhead
por: Hu, Jiaxu, et al.
Publicado: (2025)
por: Hu, Jiaxu, et al.
Publicado: (2025)
Intersecting Codes and the Connectivity of $q$-Matroids
por: Conca, Fabrizio, et al.
Publicado: (2026)
por: Conca, Fabrizio, et al.
Publicado: (2026)
Generalized GM-MDS: Polynomial Codes are Higher Order MDS
por: Brakensiek, Joshua, et al.
Publicado: (2023)
por: Brakensiek, Joshua, et al.
Publicado: (2023)
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)
Capacity-Achieving Codes for Noisy Insertion Channels
por: Liu, Hengfeng, et al.
Publicado: (2025)
por: Liu, Hengfeng, et al.
Publicado: (2025)
Upper bounds on the rate of linear $q$-ary $k$-hash codes
por: Della Fiore, Stefano, et al.
Publicado: (2024)
por: Della Fiore, Stefano, et al.
Publicado: (2024)
$q$-ary Sequential Locally Recoverable Codes from the Product Construction
por: Baghban, Akram, et al.
Publicado: (2024)
por: Baghban, Akram, et al.
Publicado: (2024)
On Lattice Constructions D and D' from q-ary Linear Codes
por: Silva, Franciele do Carmo, et al.
Publicado: (2023)
por: Silva, Franciele do Carmo, et al.
Publicado: (2023)
MDS Stabilizer Poset Codes
por: Can, Mahir Bilen
Publicado: (2024)
por: Can, Mahir Bilen
Publicado: (2024)
The Cloud and Flock Polynomials of q-Matroids
por: Gluesing-Luerssen, Heide, et al.
Publicado: (2025)
por: Gluesing-Luerssen, Heide, et al.
Publicado: (2025)
New Construction of $q$-ary Codes Correcting a Burst of at most $t$ Deletions
por: Song, Wentu, et al.
Publicado: (2024)
por: Song, Wentu, et al.
Publicado: (2024)
Constructions of $q$-ary Golay Complementary Pairs Over Flexible Non-Power-of-Two Lengths
por: Yang, Zhiye, et al.
Publicado: (2026)
por: Yang, Zhiye, et al.
Publicado: (2026)
Service Rate Regions of MDS Codes & Fractional Matchings in Quasi-uniform Hypergraphs
por: Ly, Hoang, et al.
Publicado: (2025)
por: Ly, Hoang, 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)
Delsarte duality on subspaces and applications to rank-metric codes and q-matroids
por: Borello, Martino, et al.
Publicado: (2025)
por: Borello, Martino, et al.
Publicado: (2025)
Beyond Polynomials: Optimal Locally Recoverable Codes from Good Rational Functions
por: Liu, Hengfeng, et al.
Publicado: (2026)
por: Liu, Hengfeng, et al.
Publicado: (2026)
On one-orbit cyclic subspace codes of $\mathcal{G}_q(n,3)$
por: Castello, Chiara, et al.
Publicado: (2024)
por: Castello, Chiara, et al.
Publicado: (2024)
More MDS codes of non-Reed-Solomon type
por: Wu, Yansheng, et al.
Publicado: (2024)
por: Wu, Yansheng, 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)
MDS Generalized Convertible Code
por: Ge, Songping, et al.
Publicado: (2024)
por: Ge, Songping, et al.
Publicado: (2024)
On the Maximal Length of MDS Elliptic Codes
por: Chen, Haojie, et al.
Publicado: (2026)
por: Chen, Haojie, et al.
Publicado: (2026)
New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
por: Baghban, Akram, et al.
Publicado: (2025)
por: Baghban, Akram, et al.
Publicado: (2025)
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)
Near-Optimal List-Recovery of Linear Code Families
por: Li, Ray, et al.
Publicado: (2025)
por: Li, Ray, et al.
Publicado: (2025)
The Asymmetric Hamming Bidistance and Distributions over Binary Asymmetric Channels
por: Wang, Shukai, et al.
Publicado: (2026)
por: Wang, Shukai, et al.
Publicado: (2026)
On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
por: Yu, Wenjun, et al.
Publicado: (2025)
por: Yu, Wenjun, et al.
Publicado: (2025)
Counterexamples, Constructions, and Nonexistence Results for Optimal Ternary Cyclic Codes
por: Bao, Jingjun, et al.
Publicado: (2026)
por: Bao, Jingjun, et al.
Publicado: (2026)
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)
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)
The free product of $q$-matroids
por: Alfarano, Gianira N., et al.
Publicado: (2024)
por: Alfarano, Gianira N., et al.
Publicado: (2024)
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)
New Correlation Bound and Construction of Quasi-Complementary Code Sets
por: Sarkar, Palash, et al.
Publicado: (2022)
por: Sarkar, Palash, et al.
Publicado: (2022)
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
por: Chen, Yeyuan, et al.
Publicado: (2024)
por: Chen, Yeyuan, et al.
Publicado: (2024)
Research on Linear Codes Holding $q$-Ary $t$-Designs
por: Wu, Xinghao, et al.
Publicado: (2026)
por: Wu, Xinghao, et al.
Publicado: (2026)
The incidence matrix of a $q$-ary graph
por: Ceria, Michela, et al.
Publicado: (2025)
por: Ceria, Michela, et al.
Publicado: (2025)
Ejemplares similares
-
A Further Investigation on Complete Complementary Codes from $q$-ary Functions
por: Sarkar, Palash, et al.
Publicado: (2024) -
Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes
por: Liu, Hengfeng, et al.
Publicado: (2025) -
The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
por: Liang, Xue-Bin
Publicado: (2024) -
Rank Distribution and Dynamics of Gram Matrices from Binary m-Sequences with Applications to LCD Codes
por: Liu, Hengfeng, et al.
Publicado: (2026) -
Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
por: Gabrić, Daniel, et al.
Publicado: (2024)