Results 281 to 290 of about 1,346,123 (313)
, 2020 As usual, in this chapter we consider that p denotes a prime number, q is a prime power and \({\mathbb F}_{q}\) is the finite field with q elements. We begin by defining the general concept of a code over \({\mathbb F}_{q}\); after this, we present the concept of a linear code that is the more important class of codes in coding and information theory ...
La Guardia, Giuliano Gadioli
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Information Processing Letters, 2021
A binary Write Once Memory (WOM) device is a storage mechanism in which a 0-bit can be overwritten much more easily than a 1-bit. A famous example is the flash memory technology, where 0→1 transitions are allowed, but 1 → 0 transitions require a costly erase procedure and are therefore prohibited.
Gilad Baruch +2 more
openaire +2 more sources
A binary Write Once Memory (WOM) device is a storage mechanism in which a 0-bit can be overwritten much more easily than a 1-bit. A famous example is the flash memory technology, where 0→1 transitions are allowed, but 1 → 0 transitions require a costly erase procedure and are therefore prohibited.
Gilad Baruch +2 more
openaire +2 more sources
Block and sliding-block source coding
IEEE Transactions on Information Theory, 1977A new form of source coding subject to a fidelity criterion, called sliding-block coding, has recently been introduced by Gray, Neuhoff, and Ornstein. A method of conversion from block coding to sliding-block coding, or vice versa, with an arbitrarily small increase in rate is shown for ergodic sources.
David L. Neuhoff, P. Shields
openaire +2 more sources
IEEE Information Theory Workshop, 2005., 2005
A polyalphabetic (or mixed) block code is a set of codewords of finite length, where every symbol of a codeword belongs to its own alphabet. In contrast to previous publications we consider a general case, where we do not assume any algebraic structure of the alphabets and the codes.
Valentin Afanassiev +4 more
openaire +2 more sources
A polyalphabetic (or mixed) block code is a set of codewords of finite length, where every symbol of a codeword belongs to its own alphabet. In contrast to previous publications we consider a general case, where we do not assume any algebraic structure of the alphabets and the codes.
Valentin Afanassiev +4 more
openaire +2 more sources
IEEE Transactions on Communications, 1996
The A* algorithm is applied to maximum-likelihood soft-decision decoding of binary linear block codes. This paper gives a tutorial on the A* algorithm, compares the decoding complexity with that of exhaustive search and Viterbi decoding algorithms, and presents performance curves obtained for several codes.
S.J. Dolinar, L. Ekroot
openaire +2 more sources
The A* algorithm is applied to maximum-likelihood soft-decision decoding of binary linear block codes. This paper gives a tutorial on the A* algorithm, compares the decoding complexity with that of exhaustive search and Viterbi decoding algorithms, and presents performance curves obtained for several codes.
S.J. Dolinar, L. Ekroot
openaire +2 more sources
IEEE International Symposium on Information Theory, 2003. Proceedings., 2003
Two families of braided block codes are analyzed, tightly braided block codes and sparsely braided block codes. Bounds on the free distance of tightly braided block codes are derived. Asymptotic iterative decoding performance of sparsely braided block codes is studied.
Kamil Sh. Zigangirov +2 more
openaire +2 more sources
Two families of braided block codes are analyzed, tightly braided block codes and sparsely braided block codes. Bounds on the free distance of tightly braided block codes are derived. Asymptotic iterative decoding performance of sparsely braided block codes is studied.
Kamil Sh. Zigangirov +2 more
openaire +2 more sources
Woven codes with outer block codes [PDF]
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2002 Woven codes with outer binary block codes and additional permutation are presented. This enables the construction of a new class of woven block codes, where the minimum distance is about twice the product of the minimum distances of the component codes.
Sergo Shavgulidze +3 more
openaire +1 more source
Extension of source coding theorems for block codes to sliding-block codes
IEEE Transactions on Information Theory, 1980For arbitrary alphabets and single-letter fidelity criteria, two theorems are given which allow any fixed-rate or variable-rate source coding theorem for block codes to be extended to sliding-block codes. Applications are given to universal coding and to the coding of a stationary nonergodic source.
openaire +2 more sources