Results 241 to 250 of about 359,313 (283)
Some of the next articles are maybe not open access.
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
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
Linear block codes for error detection
IEEE Trans. Inf. Theory, 2020Summary: The probability of undetected error of linear block codes for use on a binary symmetric channel is investigated. Upper bounds are derived. Several classes of linear block codes are proved to have good error-detecting capability.
Tadao Kasami +2 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
Concentration of magnetization for linear block codes
2008 IEEE International Symposium on Information Theory, 2008We consider communication over the binary erasure and the binary additive white gaussian noise channels using fixed linear block codes and also appropriate ensembles of such codes. We show concentration of the magnetization over the channel realizations and also over the code ensembles. The result has various implications.
Satish Babu Korada +2 more
openaire +1 more source
The (d,k) subcode of a linear block code
IEEE Transactions on Information Theory, 1992Summary: A simple technique employing linear block codes to construct \((d,k)\) error-correcting block codes is considered. This scheme allows asymptotically reliable transmission at rate \(R\) over a BSC channel with capacity CBSC provided \(R\leq C_{d,k}-(1+CBSC)\), where \(C_{d,k}\) is the maximum entropy of a \((d,k)\) source.
Ara Patapoutian, P. Vijay Kumar
openaire +2 more sources
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
New ternary and quaternary linear block codes
IEEE Transactions on Information Theory, 1996Summary: We present several new ternary and quaternary codes found with a heuristic search procedure, originally proposed by the authors to find good binary codes, and which is based on combinatorial optimization.
Amir Said, Reginaldo Palazzo Júnior
openaire +1 more source
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.
openaire +1 more source
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.
openaire +1 more source