AbstractThe bit error rate of binary codes on the binary symmetric channel with raw error probability p is a performance index of primary importance in many applications. It is the probability that decoded information symbols are in error after complete decoding. In this paper the class of linear block codes having a transitive group of automorphisms is considered. It is shown that a linear homogeneous differential transformation of the weight enumerator enables us to obtain a closed expression for the bit error rate in terms of p. The application of the method is general enough to allow the computation of bit error rates for all cyclic codes
An important measure of the performance of error detecting codes is the probability of undetected er...
From Conclusion: The study of error-correcting codes is now approximately 25 years old. The first kn...
In this paper, upper bound on the probability of maximum a posteriori (MAP) decoding error for syste...
AbstractThe bit error rate of binary codes on the binary symmetric channel with raw error probabilit...
In this paper, the bit error probability P(sub b) for maximum likelihood decoding of binary linear c...
In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ...
By using coding and combinatorial techniques, an approximate formula for the weight distribution of ...
We strengthen the results from a recent work by the second author, achieving bounds on the weight di...
We present an efficient algorithmic lower bound for the block error rate of linear binary block code...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
The block error probability under maximum likelihood decoding of general linear block codes and code...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
The block error probability under maximum likelihood decoding of general linear block codes and code...
D.Ing. (Electrical and Electronic)In this thesis, the problem of undetected errors in digital commun...
D.Ing. (Electrical and Electronic)In this thesis, the problem of undetected errors in digital commun...
An important measure of the performance of error detecting codes is the probability of undetected er...
From Conclusion: The study of error-correcting codes is now approximately 25 years old. The first kn...
In this paper, upper bound on the probability of maximum a posteriori (MAP) decoding error for syste...
AbstractThe bit error rate of binary codes on the binary symmetric channel with raw error probabilit...
In this paper, the bit error probability P(sub b) for maximum likelihood decoding of binary linear c...
In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ...
By using coding and combinatorial techniques, an approximate formula for the weight distribution of ...
We strengthen the results from a recent work by the second author, achieving bounds on the weight di...
We present an efficient algorithmic lower bound for the block error rate of linear binary block code...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
The block error probability under maximum likelihood decoding of general linear block codes and code...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
The block error probability under maximum likelihood decoding of general linear block codes and code...
D.Ing. (Electrical and Electronic)In this thesis, the problem of undetected errors in digital commun...
D.Ing. (Electrical and Electronic)In this thesis, the problem of undetected errors in digital commun...
An important measure of the performance of error detecting codes is the probability of undetected er...
From Conclusion: The study of error-correcting codes is now approximately 25 years old. The first kn...
In this paper, upper bound on the probability of maximum a posteriori (MAP) decoding error for syste...