Results 51 to 60 of about 72,386 (210)
CORRECTION OF DEPENDENT ERRORS BY THE TURBOcodec based ON ATTACHED evenly convolutional codes
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, 2019 The organization methods of dependent (packet) error correction by the turbocodecs based both on a sub systematic convolutional codes with uniform threshold decoding algorithm and recursive systematic convolutional codes are considered. The effectiveness
E. G. Makeichik +2 more
doaj
Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes
, 2010 Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication ...
F. Gaitan +12 more
core +1 more source
The trellis complexity of convolutional codes [PDF]
, 1995 Convolutional codes have a natural, regular, trellis structure that facilitates the implementation of Viterbi's algorithm. Linear block codes also have a natural, though not in general a regular, “minimal” trellis structure, which allows them to be ...
Lin, Wei, McEliece, Robert J.
core +2 more sources
On codes induced from Hadamard matrices
AIMS MathematicsUnit derived schemes applied to Hadamard matrices are used to construct and analyse linear block and convolutional codes. Codes are constructed to prescribed types, lengths and rates and multiple series of self-dual, dual-containing, linear complementary
Ted Hurley
doaj +1 more source
Woven Graph Codes: Asymptotic Performances and Examples
, 2008 Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensemble of such codes based on $s$-partite, $s$-uniform hypergraphs, where $s$ depends only on the code rate, there ...
Bocharova, Irina E. +3 more
core +3 more sources
Asymptotically good convolutional codes [PDF]
Linear and Multilinear Algebra, 2018 In this paper, we construct new sequences of asymptotically good convolutional codes. These sequences are obtained from sequences of transitive, self-orthogonal and self-dual block codes that attain the Tsfasman-Vladut-Zink bound. Furthermore, by applying the techniques of expanding, extending, puncturing, direct sum, the |u|u+v| construction and the ...
openaire +2 more sources
Construction of a new class of (2k, k, 1) convolutional codes
Tongxin xuebao, 2014 A new class of (2k,k,1) convolutional codes are created by combining double cyclic codes and (2,1,1) convolu-tional codes, and also a new method for creation long codes with short ones was proposed.
Cheng-chang ZHENG, Wan-quan PENG, Bo WEI
doaj +2 more sources
Closed-Loop Transcription via Convolutional Sparse Coding [PDF]
, 2023 Xili Dai +11 more
openalex +1 more source
There is no MacWilliams identity for convolutional codes [PDF]
, 1977 An example is provided of two convolutional codes that have the same transmission gain but whose dual codes do not. This shows that no analog of the MacWilliams identity for block codes can exist relating the transmission gains of a convolutional code ...
McEliece, Robert J., Shearer, James B.
core
A History of Channel Coding in Aeronautical Mobile Telemetry and Deep-Space Telemetry
EntropyThis paper presents a history of the development of channel codes in deep-space telemetry and aeronautical mobile telemetry. The history emphasizes “firsts” and other remarkable achievements.
Michael Rice
doaj +1 more source