Category Ranking
98%
Total Visits
921
Avg Visit Duration
2 minutes
Citations
20
Article Abstract
We revisit the well-known Gilbert-Varshamov (GV) bound for constrained systems. In 1991, Kolesnik and Krachkovsky showed that the GV bound can be determined via the solution of an optimization problem. Later, in 1992, Marcus and Roth modified the optimization problem and improved the GV bound in many instances. In this work, we provide explicit numerical procedures to solve these two optimization problems and, hence, compute the bounds. We then show that the procedures can be further simplified when we plot the respective curves. In the case where the graph presentation comprises a single state, we provide explicit formulas for both bounds.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11049528 | PMC |
| http://dx.doi.org/10.3390/e26040346 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Evaluating the Gilbert-Varshamov Bound for Constrained Systems.
Entropy (Basel)
April 2024
School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637121, Singapore.
Article Synopsis
- The text discusses improvements to the Gilbert-Varshamov (GV) bound for constrained systems, which is a fundamental concept in coding theory.
- It highlights the work done by Kolesnik and Krachkovsky in 1991, who connected the GV bound to an optimization problem, and the enhancements made by Marcus and Roth in 1992.
- The authors present numerical methods to solve these optimization challenges and demonstrate how these methods can be simplified for specific cases, ultimately providing formulas for scenarios with a single state.
MDS, Hermitian almost MDS, and Gilbert-Varshamov quantum codes from generalized monomial-Cartesian codes.
Quantum Inf Process
March 2024
School of Mathematics and Statistics, University College Dublin, Dublin, Ireland.
We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized monomial-Cartesian codes arise from polynomials in variables.
View Article and Find Full Text PDFBounds for Coding Theory over Rings.
Entropy (Basel)
October 2022
Department of Computer Engineering, Technical University of Munich, 80333 München, Germany.
Coding theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. It has been well established that, with the generalization of the algebraic structure to rings, there is a need to also generalize the underlying metric beyond the usual Hamming weight used in traditional coding theory over finite fields. This paper introduces a generalization of the weight introduced by Shi, Wu and Krotov, called overweight.
View Article and Find Full Text PDFAccuracy thresholds of topological color codes on the hexagonal and square-octagonal lattices.
Phys Rev E Stat Nonlin Soft Matter Phys
July 2009
Department of Physics, Tokyo Institute of Technology, Oh-okayama, Meguro-ku, Tokyo 152-8551, Japan.
Accuracy thresholds of quantum error correcting codes, which exploit topological properties of systems, defined on two different arrangements of qubits are predicted. We study the topological color codes on the hexagonal lattice and on the square-octagonal lattice by the use of mapping into the spin-glass systems. The analysis for the corresponding spin-glass systems consists of the duality, and the gauge symmetry, which has succeeded in deriving locations of special points, which are deeply related with the accuracy thresholds of topological error correcting codes.
View Article and Find Full Text PDF