Results 261 to 270 of about 359,313 (283)
Some of the next articles are maybe not open access.
Non-minimal trellises for linear block codes
1996The technique of atomic span modification is used to construct non-minimal trellises for linear block codes. Non-minimal trellises may have properties like regularity and vertex localization that make the corresponding trellis-based decoding algorithms better-suited for VLSI or multiprocessor implementation. A simple class of “universal” trellises with
Ryan Chi-Kong Lee, Frank R. Kschischang
openaire +1 more source
A Low-Complexity Probabilistic Amplitude Shaping With Short Linear Block Codes
IEEE Transactions on Communications, 2021Toshiki Matsumine +2 more
exaly
On the weight distribution of linear block codes formed from convolutional codes
IEEE Transactions on Communications, 1996J K Wolf, A J Viterbi
exaly
Linear block codes for error detection (Corresp.)
IEEE Transactions on Information Theory, 1983T Kasami, T Klove
exaly
Weight distribution of a class of binary linear block codes formed from RCPC codes
IEEE Communications Letters, 2005Pamela C Cosman, Laurence B Milstein
exaly
Iterative reliability-based decoding of linear block codes with adaptive belief propagation
IEEE Communications Letters, 2005W Jin
exaly
Constructions and bounds on linear error-block codes
Designs, Codes, and Cryptography, 2007San Ling, Ferruh Ozbudak
exaly