Binomial moments of the distance distribution and the probability of undetected error

Conference · Tue Sep 01 00:00:00 EDT 1998

OSTI ID:677090

Barg, A ^[1]; Ashikhmin, A ^[2]

---

1. Lucent Technologies, Murray Hill, NJ (United States). Bell Labs.
2. Los Alamos National Lab., NM (United States)

In [1] K.A.S. Abdel-Ghaffar derives a lower bound on the probability of undetected error for unrestricted codes. The proof relies implicitly on the binomial moments of the distance distribution of the code. The authors use the fact that these moments count the size of subcodes of the code to give a very simple proof of the bound in [1] by showing that it is essentially equivalent to the Singleton bound. They discuss some combinatorial connections revealed by this proof. They also discuss some improvements of this bound. Finally, they analyze asymptotics. They show that an upper bound on the undetected error exponent that corresponds to the bound of [1] improves known bounds on this function.

• Research Organization: Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
• Sponsoring Organization: USDOE Assistant Secretary for Management and Administration, Washington, DC (United States)
• DOE Contract Number: W-7405-ENG-36
• OSTI ID: 677090
• Report Number(s): LA-UR-98-868; CONF-980463-; ON: DE98006315; TRN: AHC29821%%225
• Resource Relation: Conference: International coding theory, Cd de Guanajuato (Mexico), 20-24 Apr 1998; Other Information: PBD: [1998]
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
DATA COVARIANCES
LIMITING VALUES
DATA TRANSMISSION
PROBABILITY
INFORMATION
SECURITY