On the information function of an error-correcting code

Authors:
T. Helleseth;T. Klove;V. I. Levenshtein
Affiliations:
Dept. of Inf., Bergen Univ.;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 7

Binomial Moments of the Distance Distribution and the Probabilityof Undetected Error

Designs, Codes and Cryptography
Extended Binomial Moments of a Linear Code and the Undetected Error Probability

Problems of Information Transmission
Average Bit Erasure Probability of Regular LDPC Code Ensembles under MAP Decoding over BEC

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Exact erasure channel density evolution for protograph-based generalized LDPC codes

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Doubly-generalized LDPC codes: stability bound over the BEC

IEEE Transactions on Information Theory
Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel

IEEE Transactions on Information Theory
Channel coding rate in the finite blocklength regime

IEEE Transactions on Information Theory

Quantified Score

Hi-index	755.02

Visualization

Abstract

The information function eh of a code is the average amount of information contained in h positions of the codewords. Upper and lower bounds on the information function of binary linear codes are given. The average value and variance of the information function over all [n, k] codes are determined,