scientific article; zbMATH DE number 3670354
From MaRDI portal
Publication:3867727
zbMATH Open0429.94021MaRDI QIDQ3867727FDOQ3867727
Authors: Arkadii G. D'yachkov 
Publication date: 1979
Full work available at URL: http://mathnet.ru/eng/ppi/v15/i2/p23
Title of this publication is not available (Why is that?)
Recommendations
- A comparison of known codes, random codes, and the best codes
- Random coding techniques for nonrandom codes
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Distance Distribution of Binary Codes and the Error Probability of Decoding
- Undetected error probabilities of codes for single-error correction and error detection
Cited In (8)
- Almost disjunctive list-decoding codes
- The probability of correcting errors by an antinoise coding method when the number of errors belongs to a random set
- Random coding bounds for discrete memoryless channels
- Title not available (Why is that?)
- Codes on \(s\)-periodic random error of length \(b\)
- On probability of correction of a random number of errors in an error-correcting coding
- Random-coding bounds for some broadcast channels
- Coding in a channel with generalized defects and random errors
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3867727)
