Results 31 to 40 of about 359,313 (283)
Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting Codes
, 2005 Simple rate-1/3 single-error-correcting unrestricted and CSS-type quantum convolutional codes are constructed from classical self-orthogonal $\F_4$-linear and $\F_2$-linear convolutional codes, respectively.
Forney, Jr., G. David, Guha, Saikat
core +2 more sources
Endomorphisms of Linear Block Codes
2024 IEEE International Symposium on Information Theory (ISIT)Accepted for presentation at International Symposium on Information Theory 2024; Included reviews: Changed some wordings, Indicate that 32,16 Polar code is a RM code; Smaller formatting changes, Results unchanged,
Mandelbaum, Jonathan +3 more
openaire +3 more sources
GEOMETRIC CONSTRUCTION CODES OF HAMMING DISTANCE-8
Electrica, 2008 A new high rate binary linear block code construction technique, named as Geometric Construction (GC) codes, was proposed recently [1]. It generates all the even full information rate (optimal) Hamming distance – 4 codes.
Gökmen Altay
doaj +2 more sources
Convolutional and tail-biting quantum error-correcting codes
, 2005 Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F_4-linear and binary linear convolutional codes ...
Forney, Jr., G. David +2 more
core +2 more sources
RNN Decoding of Linear Block Codes
CoRR, 2017 Designing a practical, low complexity, close to optimal, channel decoder for powerful algebraic codes with short to moderate block length is an open research problem. Recently it has been shown that a feed-forward neural network architecture can improve on standard belief propagation decoding, despite the large example space. In this paper we introduce
Eliya Nachmani +3 more
openaire +2 more sources
Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms
Journal of Electrical and Computer Engineering, 2012 A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new
Ahmed Azouaoui +2 more
doaj +1 more source
Advances in Electrical and Electronic Engineering, 2013 The paper deals with the problem of determination of error probability of cryptography and safety codes used within the safety-related railway applications with increasing safety integrity level (SIL).
Maria Franekova +2 more
doaj +1 more source
Binary Multilevel Convolutional Codes with Unequal Error Protection Capabilities [PDF]
, 1998 Binary multilevel convolutional codes (CCs) with unequal error protection (UEP) capabilities are studied. These codes belong to the class of generalized concatenated (GC) codes. Binary CCs are used as outer codes.
Imai, Hideki, Morelos-Zaragoza, Robert H
core +2 more sources
Simulated Annealing Decoder for Linear Block Codes [PDF]
Journal of Computer Science, 2018 En este estudio, presentamos un nuevo decodificador suave, el primero de su tipo, para códigos de bloques lineales, basado en el algoritmo de recocido simulado (SA). La principal mejora en nuestra contribución que permite que nuestro decodificador supere con gran ganancia (aproximadamente 3 dB a 7×10-4) el enfoque clásico de SA, es tomar el conjunto de
Lahcen Niharmine +3 more
openaire +1 more source
Xing-Ling Codes, Duals of their Subcodes, and Good Asymmetric Quantum Codes
, 2013 A class of powerful $q$-ary linear polynomial codes originally proposed by Xing and Ling is deployed to construct good asymmetric quantum codes via the standard CSS construction. Our quantum codes are $q$-ary block codes that encode $k$ qudits of quantum
Ezerman, Martianus Frederic +2 more
core +1 more source