Results 31 to 40 of about 223,530 (281)

Bounds on the Reliability of RaptorQ Codes in the Finite-Length Regime

IEEE Access, 2017
In this paper we analyze the bounds on the reliability of RaptorQ codes under maximum likelihood decoding, especially in the finite-length regime. RaptorQ code ensembles by a high-order low density generator-matrix (LDGM) code as pre-code and an inner ...
Ke Zhang, Qinyu Zhang, Jian Jiao
doaj   +1 more source

Improved asymptotic bounds for codes using distinguished divisors of global function fields [PDF]

, 2006
For a prime power $q$, let $\alpha_q$ be the standard function in the asymptotic theory of codes, that is, $\alpha_q(\delta)$ is the largest asymptotic information rate that can be achieved for a given asymptotic relative minimum distance $\delta$ of $q$-
Ferruh Özbudak, Harald Niederreiter, Vlăduţ S. G.   +2 more
core   +1 more source

Bounds on unique-neighbor codes [PDF]

Combinatorial Theory
To be published in Combinatorial ...
Linial, Nathan, Orzech, Edan
openaire   +2 more sources

Quantum Error Correction via Codes over GF(4) [PDF]

, 1996
The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product.
Calderbank, A. R., Rains, E. M, Shor, P. W., Sloane, N. J. A.   +3 more
core   +10 more sources

Frameproof codes, separable codes and $$B_2$$ codes: Bounds and constructions

Cryptography and Communications, 2023
AbstractIn this paper, constructions of frameproof codes, separable codes, and $$B_2$$ B 2 codes are obtained. For each family of codes, the Lovász Local Lemmais used to establish lower bounds for the codes.
Fernández Muñoz, Marcel, Livieratos, John, Martín Mollevi, Sebastià   +2 more
openaire   +5 more sources

New upper bounds for kissing numbers from semidefinite programming [PDF]

, 2006
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions.
Bachoc, Christine, Vallentin, Frank
core   +7 more sources

Error-Correcting Codes on Projective Bundles over Deligne–Lusztig Varieties

Mathematics, 2023
The aim of this article is to give lower bounds on the parameters of algebraic geometric error-correcting codes constructed from projective bundles over Deligne–Lusztig surfaces.
Daniel Camazón Portela, Juan Antonio López Ramos   +1 more
doaj   +1 more source

New Binary Quantum Codes Derived From One-Generator Quasi-Cyclic Codes

IEEE Access, 2019
In this paper, we consider a family of one-generator quasi-cyclic (QC) codes and their applications in quantum codes construction. We give a sufficient condition for one-generator QC codes to be self-orthogonal with respect to the symplectic inner ...
Jingjie Lv, Ruihu Li, Junli Wang
doaj   +1 more source

Some New Quantum BCH Codes over Finite Fields

Entropy, 2021
Quantum error correcting codes (QECCs) play an important role in preventing quantum information decoherence. Good quantum stabilizer codes were constructed by classical error correcting codes.
Lijuan Xing, Zhuo Li
doaj   +1 more source

Capacity-Approaching Non-Binary Turbo Codes: A Hybrid Design Based on EXIT Charts and Union Bounds

IEEE Access, 2018
In this paper, we introduce a novel design approach for capacity-approaching non-binary turbo codes. There are two important factors that impact the performance of turbo codes in general: 1) the convergence behavior of iterative decoding in the low ...
Toshiki Matsumine, Hideki Ochiai
doaj   +1 more source