Cover Image

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Berman, Amit, Shany, Yaron, Tamo, Itzhak
Format:	Preprint
Published:	2023
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes
by: Shany, Yaron, et al.
Published: (2024)

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
by: Berman, Amit, et al.
Published: (2026)

Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
by: Berman, Amit, et al.
Published: (2024)

Non-Binary Covering Codes for Low-Access Computations
by: Ramkumar, Vinayak, et al.
Published: (2024)

On the Minimum Distances of Some Families of BCH Codes
by: Chen, Yaqi, et al.
Published: (2026)

On the Minimum Distances of Some Families of Goppa Codes and BCH Codes
by: Chen, Yaqi, et al.
Published: (2026)

Algebraic Expander Codes
by: Kopparty, Swastik, et al.
Published: (2026)

Enumeration of Minimum Weight Codewords of Pre-Transformed Polar Codes by Tree Intersection
by: Zunker, Andreas, et al.
Published: (2023)

Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)

$\varepsilon$-MSR Codes for Any Set of Helper Nodes
by: Ramkumar, Vinayak, et al.
Published: (2024)

Quantum Locally Recoverable Codes via Good Polynomials
by: Sharma, Sandeep, et al.
Published: (2024)

Cyclic and BCH Codes whose Minimum Distance Equals their Maximum BCH bound
by: Bernal, José Joaquín, et al.
Published: (2024)

Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions
by: Con, Roni, et al.
Published: (2023)

Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
by: Con, Roni, et al.
Published: (2024)

On the Maximum Number of Codewords of X-Codes of Constant Weight Three
by: Tsunoda, Yu, et al.
Published: (2019)

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

On the Error Rate of Binary BCH Codes under Error-and-erasure Decoding
by: Miao, Sisi, et al.
Published: (2025)

On the Performance of Short Binary BCH Codes for Ultra-Low Latency Wireless Communications
by: Morelos-Zaragoza, Robert, et al.
Published: (2024)

Pure-State Quantum Tomography with Minimal Rank-One POVMs
by: Edidin, Dan, et al.
Published: (2025)

The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes
by: Yohananov, Lev, et al.
Published: (2024)

Quasi-BP for BCH Codes and its Optimization
by: Li, Guangwen
Published: (2026)

The Exact Parameters of A Family of BCH Codes
by: Sun, Zhonghua
Published: (2025)

Near-Codewords Aware Bit Flipping Decoding of QC-MDPC Codes
by: Baldelli, Alessio, et al.
Published: (2026)

Apparent Distance and a Notion of BCH Multivariate Codes
by: Bernal, José Joaquín, et al.
Published: (2024)

New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance
by: Zheng, Lingqi, et al.
Published: (2025)

Guessing What, Noise or Codeword?
by: Ma, Xiao
Published: (2024)

Extension of the Poltyrev Bound to Binary Memoryless Symmetric Channels
by: Philosof, Tal, et al.
Published: (2025)

Construction Methods Based on Minimum Weight Distribution for Polar Codes with Successive Cancellation List Decoding
by: Piao, Jinnan, et al.
Published: (2023)

Codeword Stabilized Codes from m-Uniform Graph States
by: Sudevan, Sowrabh, et al.
Published: (2024)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
by: Bruno, Roberto, et al.
Published: (2025)

Combinatorial alphabet-dependent bounds for insdel codes
by: Kong, Xiangliang, et al.
Published: (2024)

Soft-output Guessing Codeword Decoding
by: Duffy, Ken R., et al.
Published: (2024)

Marker+Codeword+Marker: A Coding Structure for Segmented Single-Insdel/-Edit Channels
by: Li, Zhen, et al.
Published: (2024)

Making it to First: The Random Access Problem in DNA Storage
by: Boruchovsky, Avital, et al.
Published: (2025)

A Structural Characterization of Cyclotomic Cosets with Applications to Affine-Invariant Codes and BCH Codes
by: Zheng, Xiongkun, et al.
Published: (2026)

Performance-Complexity-Latency Trade-offs of Concatenated RS-BCH Codes
by: Sukmadji, Alvin Y., et al.
Published: (2024)

Effective Application of Normalized Min-Sum Decoding for Short BCH Codes
by: Li, Guangwen, et al.
Published: (2024)

About Optimal Prefix Codes over Countably Infinite Alphabets: Probabilistic Intervals for the Codeword Lengths Assignment
by: Liu, Hongyang, et al.
Published: (2026)

Quantum $(r,δ)$-Locally Recoverable BCH and Homothetic-BCH Codes
by: Galindo, Carlos, et al.
Published: (2026)

Explaining Robust Quantum Metrology by Counting Codewords
by: Novak, Oskar, et al.
Published: (2025)