New dimension-independent upper bounds on linear insdel codes
From MaRDI portal
Publication:6605877
DOI10.3934/AMC.2023008MaRDI QIDQ6605877FDOQ6605877
Conghui Xie, Longjiang Qu, Hao Chen, Ling Liu
Publication date: 16 September 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
cyclic codesReed-Muller codesalgebraic geometry codelinear codes with few non-zero weightslinear insertion-deletion codesordering-depending upper boundordering-free upper bound
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- The Geometry of Two-Weight Codes
- Perfect nonlinear S-boxes
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Fundamentals of Error-Correcting Codes
- The weight distribution of a class of linear codes from perfect nonlinear functions
- Linear Codes From Some 2-Designs
- A construction of binary linear codes from Boolean functions
- Cyclotomic Linear Codes of Order $3$
- On the Covering Structures of Two Classes of Linear Codes From Perfect Nonlinear Functions
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- Nonbinary codes, correcting single deletion or insertion (Corresp.)
- Asymptotically good codes correcting insertions, deletions, and transpositions
- Constructions of several classes of linear codes with a few weights
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- The weight distributions of two classes of binary cyclic codes
- Binary Linear Codes With Few Weights From Two-to-One Functions
- Reliable communication over channels with insertions, deletions, and substitutions
- On Bonisoli's theorem and the block codes of Steiner triple systems
- Narrow-Sense BCH Codes Over $ {\mathrm {GF}}(q)$ With Length $n=\frac {q^{m}-1}{q-1}$
- Synchronization strings
- Synchronization strings: explicit constructions, local decoding, and applications
- A class of constacyclic BCH codes
- The weight hierarchy of the Kasami codes
- Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
- On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
- Classification of the Deletion Correcting Capabilities of Reed–Solomon Codes of Dimension $2$ Over Prime Fields
- Correcting Deletions Using Linear and Cyclic Codes
- Some Punctured Codes of Several Families of Binary Linear Codes
- Codes Correcting Two Deletions
- Using Reed–Muller ${\hbox{RM}}\,(1, m)$ Codes Over Channels With Synchronization and Substitution Errors
- Efficiently List-Decodable Insertion and Deletion Codes via Concatenation
- Coding Over Sets for DNA Storage
- Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
- Synchronization Strings and Codes for Insertions and Deletions—A Survey
- Deletion Codes in the High-Noise and High-Rate Regimes
- Improved Singleton Bound on Insertion-Deletion Codes and Optimal Constructions
- Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes
- Exact Reconstruction From Insertions in Synchronization Codes
- Reed Solomon Codes Against Adversarial Insertions and Deletions
This page was built for publication: New dimension-independent upper bounds on linear insdel codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605877)
