Results 211 to 220 of about 40,762 (259)
Some of the next articles are maybe not open access.
2015
This chapter deals with linear block codes covering their fundamental concepts, generator and parity check matrices, error-correcting capabilities, encoding and decoding, and performance analysis.
exaly +2 more sources
This chapter deals with linear block codes covering their fundamental concepts, generator and parity check matrices, error-correcting capabilities, encoding and decoding, and performance analysis.
exaly +2 more sources
The ABCs of linear block codes
IEEE Signal Processing Magazine, 2004The basic principles of block codes are presented with illustrations to visualize the concepts of vector spaces and subspaces. Intuitive explanations of goals, capabilities, and limitations of codes are offered. An important subclass of block codes called cyclic codes is examined.
Bernard Sklar, Fred Harris
openaire +1 more source
IEEE Potentials, 2001
The article discusses systematic cyclic linear block codes. A block code uses an encoder that accepts a block of message symbols, and generates a block of code word symbols at the output. This type is in contrast to a convolutional code when the encoder accepts a continuous stream of symbols and similarly generates a continuous encoded output stream. A
L. Litwin, K. Ramaswamy
openaire +1 more source
The article discusses systematic cyclic linear block codes. A block code uses an encoder that accepts a block of message symbols, and generates a block of code word symbols at the output. This type is in contrast to a convolutional code when the encoder accepts a continuous stream of symbols and similarly generates a continuous encoded output stream. A
L. Litwin, K. Ramaswamy
openaire +1 more source
1998
Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. We mainly present the basic concepts of encoding and decoding of linear block codes and state some facts without ...
Shu Lin +3 more
openaire +1 more source
Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. We mainly present the basic concepts of encoding and decoding of linear block codes and state some facts without ...
Shu Lin +3 more
openaire +1 more source
On the Coding Gain of Linear Binary Block Codes
IEEE Transactions on Communications, 1984The coding gain of linear binary block codes on the AWGN channel is studied. Antipodal signaling and hard decision demodulation are assumed. Simple asymptotic expressions for the gain at high and low energy to noise spectral density ratios are derived. Monotonicity of the coding gain is also discussed.
Vladan M. Jovanovic, Srdjan Z. Budisin
openaire +1 more source
New decoder for linear block codes
2016 International Conference on Advanced Communication Systems and Information Security (ACOSIS), 2016This paper exposes a new decoder for linear bloc codes. The proposed decoder is based on the resolution of the parity equations system. Elsewhere, to reduce its complexity we have developed a criteria for early terminating the decoding, on the one hand. On the other hand, we introduced a fast method for generating test error patterns.
Abderrazak Farchane, Mostafa Belkasmi
openaire +1 more source
Genetic decoding of linear block codes
Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 2003This paper investigates the application of genetic algorithms to the decoding problem of error-correcting codes. The basic operations of crossover, mutation and selection are appropriately defined for the decoding problem of binary linear block codes without the knowledge of any algebraic structure.
Fabbryccio A. C. M. Cardoso +1 more
openaire +1 more source
On importance sampling for linear block codes
IEEE International Conference on Communications, 2003. ICC '03., 2004We introduce an importance sampling scheme for linear block codes with message-passing decoding. This novel scheme overcomes an existing difficulty in the IS practice that requires codebook information. Experiments show large IS gains for single parity-check codes and short-length block codes.
Bo Xia, William E. Ryan
openaire +1 more source
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 ...
openaire +1 more source
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 ...
openaire +1 more source
1999
Some elementary concepts of block codes are introduced in Chapter 1. In general, it is known that the encoding and decoding of 2 k codewords of length n can be quite complicated when n and k are large unless the encoder has certain special structures. In this chapter, a class of block codes, called linear block codes, is discussed.
Irving S. Reed, Xuemin Chen
openaire +1 more source
Some elementary concepts of block codes are introduced in Chapter 1. In general, it is known that the encoding and decoding of 2 k codewords of length n can be quite complicated when n and k are large unless the encoder has certain special structures. In this chapter, a class of block codes, called linear block codes, is discussed.
Irving S. Reed, Xuemin Chen
openaire +1 more source