Amanote Research
Register
Sign In
On the Probability of Undetected Error for the Maximum Distance Separable Codes
IEEE Transactions on Communications
doi 10.1109/tcom.1984.1096175
Full Text
Open PDF
Abstract
Available in
full text
Date
September 1, 1984
Authors
T. Kasami
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Related search
On the Probability of Undetected Error for Overextended Reed–Solomon Codes
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
Bounds on the Undetected Error Probabilities of Linear Codes for Both Error Correction and Detection
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
Bounds on the Maximum-Likelihood Decoding Error Probability of Low-Density Parity-Check Codes
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
Undetected Error Probabilities of Binary Primitive BCH Codes for Both Error Correction and Detection
IEEE Transactions on Communications
Electronic Engineering
Electrical
Improved Undetected Error Probability Model for JTEC and JTEC-SQED Coding Schemes
An Improved Bound on the List Error Probability and List Distance Properties
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
Construction of Maximum Distance Separable Rhotrices Using Cauchy Rhotrices Over Finite Fields
International Journal of Computer Applications
On the Minimum Distance of Cyclic Codes
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
Flag Fault-Tolerant Error Correction With Arbitrary Distance Codes
Quantum
