Cover Image

A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Guruswami, Venkatesan, Li, Shilun
Format:	Preprint
Published:	2023
Subjects:	Information Theory Combinatorics 94B25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

New Bounds and Constructions for Variable Packet-Error Coding
by: Kong, Xiangliang, et al.
Published: (2025)

Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes
by: Lo, Yuan-Hsun, et al.
Published: (2024)

Constructing MRD codes by switching
by: Shi, Minjia, et al.
Published: (2022)

Storage codes on coset graphs with asymptotically unit rate
by: Barg, Alexander, et al.
Published: (2022)

On maximum distance separable and completely regular codes
by: Borges, Joaquim, et al.
Published: (2025)

On the hull-variation problem of equivalent vector rank metric codes
by: Ho, Duy, et al.
Published: (2025)

On the maximum size of variable-length non-overlapping codes
by: Wang, Geyang, et al.
Published: (2024)

On the Structure of the Linear Codes with a Given Automorphism
by: Bouyuklieva, Stefka
Published: (2023)

Linear codes for $b$-symbol read channels attaining the Griesmer bound
by: Kurz, Sascha
Published: (2025)

Additive codes attaining the Griesmer bound
by: Kurz, Sascha
Published: (2024)

A generalisation of bent vectors for Butson Hadamard matrices
by: Armario, José Andrés, et al.
Published: (2024)

Digit-Indexed q-ary SEC-DED Codes with Near-Hamming Overhead
by: Hu, Jiaxu, et al.
Published: (2025)

Hierarchical Quasi-cyclic Codes from Reed-Solomon and Polynomial Evaluation Codes
by: McMillon, Emily, et al.
Published: (2025)

Multifold 1-perfect codes
by: Krotov, Denis S.
Published: (2022)

The Sequence Reconstruction of Permutations under Hamming Metric with Small Errors
by: Abdollahi, A., et al.
Published: (2026)

On automorphism groups of polar codes
by: Ma, Jicheng, et al.
Published: (2024)

Constructions and bounds for subspace codes
by: Kurz, Sascha
Published: (2021)

An upper bound on the size of a code with $s$ distances
by: Landjev, Ivan, et al.
Published: (2025)

How to Expand a Self-orthogonal Code
by: Kim, Jon-Lark, et al.
Published: (2025)

Log-Concave Sequences in Coding Theory
by: Shi, Minjia, et al.
Published: (2024)

On the Algebraic Structure Underlying the Support Enumerators of Linear Codes
by: Kenjale, Nitin, et al.
Published: (2026)

A note on small weight codewords of projective geometric codes and on the smallest sets of even type
by: Adriaensen, Sam
Published: (2023)

Linear Binary Codes Correcting One or More Errors
by: Izhitskii, Timofei
Published: (2025)

Bounds on MLDR Codes Over ${\mathbb Z}_{p^t}$
by: Alderson, Tim L.
Published: (2024)

Construction of extremal Type II $\mathbb{Z}_{8}$-codes via doubling method
by: Ban, Sara, et al.
Published: (2024)

Constructions of block MDS LDPC codes from punctured circulant matrices
by: Zhu, Hongwei, et al.
Published: (2025)

An infinite family of non-extendable MRD codes
by: Bartoli, Daniele, et al.
Published: (2026)

Higher weight spectra of ternary codes associated to the quadratic Veronese $3$-fold
by: Kaipa, Krishna, et al.
Published: (2024)

Non-projective two-weight codes
by: Kurz, Sascha
Published: (2024)

On extended perfect codes
by: Vorob'ev, Konstantin
Published: (2024)

Maximal Recoverability: A Nexus of Coding Theory
by: Brakensiek, Joshua, et al.
Published: (2026)

On completely regular self-dual codes with covering radius $ρ\leq 3$
by: Borges, J., et al.
Published: (2024)

Linear codes arising from geometrical operation
by: López, Antonio Jesús Lorite, et al.
Published: (2026)

A note on the Assmus--Mattson theorem for some ternary codes (a resume)
by: Bannai, Eiichi, et al.
Published: (2023)

Weight distributions of simplex codes over finite chain rings and their Gray map images
by: Fernández-Córdoba, Cristina, et al.
Published: (2025)

Line Hermitian Grassmann Codes and their Parameters
by: Cardinali, Ilaria, et al.
Published: (2017)

Unique Optima of the Delsarte Linear Program
by: Li, Rupert
Published: (2022)

New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code
by: Davydov, Alexander A., et al.
Published: (2025)

Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes
by: Liu, Hengfeng, et al.
Published: (2025)

Punctured Low-Bias Codes Behave Like Random Linear Codes
by: Guruswami, Venkatesan, et al.
Published: (2021)