Results 251 to 260 of about 546,093 (294)
Some of the next articles are maybe not open access.
Concatenated group codes and their exponents
IEEE Transactions on Information Theory, 1987Codes that are concatenations of group codes are considered. It is shown that when G and H are finite groups and the inner and outer codes are G- and H-codes, respectively, then under certain conditions the concatenated code is a \(G\times H\) code.
openaire +3 more sources
Concatenated hash code selection
International Journal of Computer & Information Sciences, 1984Summary: An algorithm for selecting the concatenated hash code for partial-match or multiple-attribute retrieval in a hashing scheme is presented. The optimal code length for each attribute is determined with respect to a merit function. Two adjustment algorithms are then presented to find the optimal code length under the integer and nonnegative lower
S. K. Chang, J. C. Dorng
openaire +2 more sources
Generalized concatenation of convolutional codes
European Transactions on Telecommunications, 1996AbstractGeneralized concatenation of inner and outer convolutional codes is studied. The essential problem is the partitioning of the inner code. A construction procedure to obtain a suitable equivalent description for a given code is derived, which gives the best possible distances in the partitioned subcodes. The construction rule is illustrated with
Martin Bossert +2 more
openaire +2 more sources
Superimposed concatenated codes (Corresp.)
IEEE Transactions on Information Theory, 1980A family of codes of length n=q^{s+l} over GF( q ), with 2s \leq q are presented which are constructed by superimposing concatenated codes on a concatenated code. The rate r and the distance ratio \delta of the new codes satisfy the relation r=1-\delta+\delta \ln (\delta) for sufficiently large values of n and q/s .
Yasuo Sugiyama +3 more
openaire +2 more sources
On the Concatenated Structure of a Linear Code
Applicable Algebra in Engineering, Communication and Computing, 1998Let \(F_q\) be a finite field with \(q\) elements and denote by \(C(n,k,d)\) a linear code of length \(n\) over \(F_q\) of dimension \(k\) and minimum distance \(d\). Define \(B(n_B,k_B,d_B)\) over \(F_q\) to be an inner code, \(E(n_E,k_E,d_E)\) over \(F_{q^{k_B}}\) to be an outer code and \({\mathcal C}\) to be the concatenateed code, obtained by ...
openaire +3 more sources
An Introduction to Generalized Concatenated Codes
European Transactions on Telecommunications, 1999AbstractThis paper presents an introduction to the theory of generalized concatenated codes. We consider the encoding and decoding procedures of both ordinary concatenated codes, and generalized concatenated codes where block codes are used as inner codes.
Victor V. Zyablov +2 more
openaire +2 more sources
Concatenated space-time coding
12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598), 2002The serial concatenation of standard convolutional codes with differential space-time modulation is considered for fast flat fading multiple antenna channels. Decoding is performed iteratively by passing symbol-wise a-posteriori probability information between the decoders of the inner space-time code and the outer convolutional code.
Christian Schlegel, Alex J. Grant
openaire +1 more source
Concatenated twist Hadamard codes
IEEE Communications Letters, 2007In this letter, a new class of low-rate error-correcting codes named twist Hadamard codes (TwHC) are designed based on two single parity check constraints in bi-orthogonal Hadamard codes. TwHC consists of two branches zigzag Hadamard codes (ZHC) twisted together. Its decoding complexity is very low with the help of fast Hadamard transform.
Shuling Che, Peng Wang, Xinmei Wang
openaire +1 more source
Concatenated convolutional codes with interleavers
IEEE Communications Magazine, 2003This article presents a tutorial overview of the class of concatenated convolutional codes with interleavers, also known as turbo-like codes. They are powerful codes, formed by a number of encoders connected through interleavers, endowed by a decoding algorithm that splits the decoding burden into separate decoding of each individual code.
BENEDETTO, Sergio +2 more
openaire +2 more sources
Concatenated zigzag hadamard codes
IEEE Transactions on Information Theory, 2006In this correspondence, we introduce a new class of low-rate error correction codes called zigzag Hadamard (ZH) codes and their concatenation schemes. Each member of this class of codes is specified by a highly structured zigzag graph with each segment being a Hadamard codeword.
Raymond W. K. Leung +3 more
openaire +2 more sources