Results 31 to 40 of about 16,644 (310)
On p-Adic Estimates of Weights in Abelian Codes over Galois Rings [PDF]
, 2005 Let p be a prime. We prove various analogues and generalizations of McEliece's theorem on the p-divisibility of weights of words in cyclic codes over a finite field of characteristic p. Here we consider Abelian codes over various Galois rings.
Katz, Daniel Jerome
core +1 more source
Bounds on unique-neighbor codes [PDF]
Combinatorial TheoryTo be published in Combinatorial ...
Linial, Nathan, Orzech, Edan
openaire +2 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 +1 more
doaj +1 more source
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 +2 more
openaire +5 more sources
Adaptive nested trellis decoding for block codes. [PDF]
, 1994 A new adaptive trellis decoding technique for block codes is proposed. The technique is based on an encoding technique which allows the design of almost all known linear codes together with their minimal trellises.
Markarian, G. S. +5 more
core +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
Construction and bounds for subspace codes
CoRR, 2021 Subspace codes are the $q$-analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random linear network coding, distributed storage, and cryptography. In this chapter we survey known constructions and upper bounds for subspace codes.
openaire +2 more sources
On the distance distribution of duals of BCH codes
, 1999 We derive upper bounds on the components of the distance distribution of duals of BCH codes. Roughly speaking, these bounds show that the distance distribution can be upper-bounded by the corresponding normal distribution. To derive the bounds we use the
Krasikov, I
core +1 more source