Bounds on Spectra of Codes with Known Dual Distance
Designs, Codes and Cryptography
Problems of Information Transmission
Channel coding as a cryptography enhancer
ICCOM'07 Proceedings of the 11th Conference on 11th WSEAS International Conference on Communications - Volume 11
Redundant optical data transmission using semiconductor lasers
AICCSA '08 Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications
Fieldbus: a solution for safety and availability?
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
The minimum distance of the dual of a CRC
CIMMACS'07 Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
On the cyclic redundancy-check codes with 8-bit redundancy
Computer Communications
Estimates for the range of binomiality in codes' spectra
IEEE Transactions on Information Theory
Linear programming bounds for doubly-even self-dual codes
IEEE Transactions on Information Theory
Estimates of the distance distribution of codes and designs
IEEE Transactions on Information Theory
Bounds on distance distributions in codes of known size
IEEE Transactions on Information Theory
Redundant data transmission and nonlinear codes
WSEAS TRANSACTIONS on COMMUNICATIONS
| Hi-index | 0.00 |
Proper linear codes play an important role in error detection. They are characterized by an increasing probability of undetected error pue(ε, C) and are considered "good for error detection". A lot of CRCs commonly used to protect data transmission via a variety of field busses are known for being proper. In this paper the weight distribution of proper linear codes on a binary symmetric channel without memory is investigated. A proof is given that its components are upper bounded by the binomial coefficients in a certain sense. Secondly an upper bound of the tail of the binomial is given, and the results are then used to derive estimates of pue(ε, C). If a code is not proper, it would be desirable to have at least subintervals, where pue(ε, C) increases, or where it satisfies the 2-r-bound. It is for this reason that next the range of monotonicity and of the 2-r-bound is determined. Finally, applications on safety integrity levels are studied.