Undetected error probability of \(q\)-ary constant weight codes
From MaRDI portal
Publication:1009031
DOI10.1007/S10623-007-9130-1zbMath1178.94232OpenAlexW2006455545MaRDI QIDQ1009031
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9130-1
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Bounds on codes (94B65) Error probability in coding theory (94B70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the nonbinary Johnson scheme
- Binomial moments of the distance distribution and the probability of undetected error.
- Optimal constant weight codes over \(Z_k\) and generalized designs
- Extended binomial moments of a linear code and the undetected error probability
- The Probability of Undetected Error for Binary Constant-Weight Codes
- A Lower Bound on the Probability of Undetected Error for Binary Constant Weight Codes
- Optical orthogonal codes: design, analysis and applications
- On the undetected error probability of nonlinear binary constant weight codes
- A lower bound on the undetected error probability and strictly optimal codes
- Binary constant-weight codes for error detection
- MDS array codes for correcting a single criss-cross error
- The undetected error probability threshold of m-out-of-n codes
- On the undetected error probability for binary codes
- Binomial moments of the distance distribution: bounds and applications
- On Some Tactical Configurations
This page was built for publication: Undetected error probability of \(q\)-ary constant weight codes