The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes
Fuente:
arXiv
Guardado en:
| Autores principales: | Shany, Yaron, Berman, Amit |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
por: Berman, Amit, et al.
Publicado: (2023)
por: Berman, Amit, et al.
Publicado: (2023)
Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
por: Berman, Amit, et al.
Publicado: (2026)
por: Berman, Amit, et al.
Publicado: (2026)
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
por: Berman, Amit, et al.
Publicado: (2024)
por: Berman, Amit, et al.
Publicado: (2024)
On the Minimum Distances of Some Families of BCH Codes
por: Chen, Yaqi, et al.
Publicado: (2026)
por: Chen, Yaqi, et al.
Publicado: (2026)
On the Minimum Distances of Some Families of Goppa Codes and BCH Codes
por: Chen, Yaqi, et al.
Publicado: (2026)
por: Chen, Yaqi, et al.
Publicado: (2026)
Enumeration of Minimum Weight Codewords of Pre-Transformed Polar Codes by Tree Intersection
por: Zunker, Andreas, et al.
Publicado: (2023)
por: Zunker, Andreas, et al.
Publicado: (2023)
Cyclic and BCH Codes whose Minimum Distance Equals their Maximum BCH bound
por: Bernal, José Joaquín, et al.
Publicado: (2024)
por: Bernal, José Joaquín, et al.
Publicado: (2024)
On the Maximum Number of Codewords of X-Codes of Constant Weight Three
por: Tsunoda, Yu, et al.
Publicado: (2019)
por: Tsunoda, Yu, et al.
Publicado: (2019)
The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes
por: Yohananov, Lev, et al.
Publicado: (2024)
por: Yohananov, Lev, et al.
Publicado: (2024)
On the Error Rate of Binary BCH Codes under Error-and-erasure Decoding
por: Miao, Sisi, et al.
Publicado: (2025)
por: Miao, Sisi, et al.
Publicado: (2025)
On the Performance of Short Binary BCH Codes for Ultra-Low Latency Wireless Communications
por: Morelos-Zaragoza, Robert, et al.
Publicado: (2024)
por: Morelos-Zaragoza, Robert, et al.
Publicado: (2024)
Quasi-BP for BCH Codes and its Optimization
por: Li, Guangwen
Publicado: (2026)
por: Li, Guangwen
Publicado: (2026)
The Exact Parameters of A Family of BCH Codes
por: Sun, Zhonghua
Publicado: (2025)
por: Sun, Zhonghua
Publicado: (2025)
Apparent Distance and a Notion of BCH Multivariate Codes
por: Bernal, José Joaquín, et al.
Publicado: (2024)
por: Bernal, José Joaquín, et al.
Publicado: (2024)
Near-Codewords Aware Bit Flipping Decoding of QC-MDPC Codes
por: Baldelli, Alessio, et al.
Publicado: (2026)
por: Baldelli, Alessio, et al.
Publicado: (2026)
Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
por: Bruno, Roberto, et al.
Publicado: (2025)
por: Bruno, Roberto, et al.
Publicado: (2025)
Guessing What, Noise or Codeword?
por: Ma, Xiao
Publicado: (2024)
por: Ma, Xiao
Publicado: (2024)
Extension of the Poltyrev Bound to Binary Memoryless Symmetric Channels
por: Philosof, Tal, et al.
Publicado: (2025)
por: Philosof, Tal, et al.
Publicado: (2025)
Codeword Stabilized Codes from m-Uniform Graph States
por: Sudevan, Sowrabh, et al.
Publicado: (2024)
por: Sudevan, Sowrabh, et al.
Publicado: (2024)
Soft-output Guessing Codeword Decoding
por: Duffy, Ken R., et al.
Publicado: (2024)
por: Duffy, Ken R., et al.
Publicado: (2024)
Marker+Codeword+Marker: A Coding Structure for Segmented Single-Insdel/-Edit Channels
por: Li, Zhen, et al.
Publicado: (2024)
por: Li, Zhen, et al.
Publicado: (2024)
A Structural Characterization of Cyclotomic Cosets with Applications to Affine-Invariant Codes and BCH Codes
por: Zheng, Xiongkun, et al.
Publicado: (2026)
por: Zheng, Xiongkun, et al.
Publicado: (2026)
Performance-Complexity-Latency Trade-offs of Concatenated RS-BCH Codes
por: Sukmadji, Alvin Y., et al.
Publicado: (2024)
por: Sukmadji, Alvin Y., et al.
Publicado: (2024)
Effective Application of Normalized Min-Sum Decoding for Short BCH Codes
por: Li, Guangwen, et al.
Publicado: (2024)
por: Li, Guangwen, et al.
Publicado: (2024)
About Optimal Prefix Codes over Countably Infinite Alphabets: Probabilistic Intervals for the Codeword Lengths Assignment
por: Liu, Hongyang, et al.
Publicado: (2026)
por: Liu, Hongyang, et al.
Publicado: (2026)
Quantum $(r,δ)$-Locally Recoverable BCH and Homothetic-BCH Codes
por: Galindo, Carlos, et al.
Publicado: (2026)
por: Galindo, Carlos, et al.
Publicado: (2026)
Explaining Robust Quantum Metrology by Counting Codewords
por: Novak, Oskar, et al.
Publicado: (2025)
por: Novak, Oskar, et al.
Publicado: (2025)
Quantum Constacyclic BCH Codes over Qudits: A Spectral-Domain Approach
por: Patel, Shikha, et al.
Publicado: (2024)
por: Patel, Shikha, et al.
Publicado: (2024)
Using a Single-Parity-Check to Reduce the Guesswork of Guessing Codeword Decoding
por: Griffin, Joseph, et al.
Publicado: (2024)
por: Griffin, Joseph, et al.
Publicado: (2024)
The dual codes of two families of BCH codes
por: Xu, Haojie, et al.
Publicado: (2024)
por: Xu, Haojie, et al.
Publicado: (2024)
New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance
por: Zheng, Lingqi, et al.
Publicado: (2025)
por: Zheng, Lingqi, et al.
Publicado: (2025)
Three Families of Projective Binary Linear Codes of at Most Four Weights
por: Zhang, Tonghui, et al.
Publicado: (2025)
por: Zhang, Tonghui, et al.
Publicado: (2025)
The dual codes of two classes of LCD BCH codes
por: Fu, Yuqing, et al.
Publicado: (2024)
por: Fu, Yuqing, et al.
Publicado: (2024)
New quantum codes from homothetic-BCH codes
por: Galindo, Carlos, et al.
Publicado: (2025)
por: Galindo, Carlos, et al.
Publicado: (2025)
Finite Field Multiple Access II:from Symbol-wise to Codeword-wise
por: Yu, Qi-yue, et al.
Publicado: (2025)
por: Yu, Qi-yue, et al.
Publicado: (2025)
Construction Methods Based on Minimum Weight Distribution for Polar Codes with Successive Cancellation List Decoding
por: Piao, Jinnan, et al.
Publicado: (2023)
por: Piao, Jinnan, et al.
Publicado: (2023)
On Minimum Distances for Error Correction and Detection of Generalized Network Code
por: Chen, Yulin, et al.
Publicado: (2026)
por: Chen, Yulin, et al.
Publicado: (2026)
Iterative decoding of short BCH codes and its post-processing
por: Li, Guangwen, et al.
Publicado: (2024)
por: Li, Guangwen, et al.
Publicado: (2024)
Two classes of LCD BCH codes over finite fields
por: Fu, Yuqing, et al.
Publicado: (2024)
por: Fu, Yuqing, et al.
Publicado: (2024)
The minimum distance of the antiprimitive BCH code with designed distance 3
por: Xu, Haojie, et al.
Publicado: (2025)
por: Xu, Haojie, et al.
Publicado: (2025)
Ejemplares similares
-
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
por: Berman, Amit, et al.
Publicado: (2023) -
Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
por: Berman, Amit, et al.
Publicado: (2026) -
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
por: Berman, Amit, et al.
Publicado: (2024) -
On the Minimum Distances of Some Families of BCH Codes
por: Chen, Yaqi, et al.
Publicado: (2026) -
On the Minimum Distances of Some Families of Goppa Codes and BCH Codes
por: Chen, Yaqi, et al.
Publicado: (2026)