Asymptotic Bounds for Unidirectional Byte Error-Correcting Codes (Special Section on Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
Asymptotic bounds are considered for unidirectional byte error-correcting codes. Upper bounds are developed from the concepts of the Singleton, Plotkin, and Hamming bounds. Lower bounds are also derived from a combination of the generalized concatenated code construction and the Varshamov-Gilbert bound. As the result, we find that there exist codes of low rate better than those on the basis of Hamming distance with respect to unidirectional byte error-correction.
- 1993-09-25
著者
-
IMAI Hideki
the Institute of Industrial Science, The University of Tokyo
-
Saitoh Yuichi
The Institute Of Industrial Science The University Of Tokyo
-
Imai Hideki
The Institute Of Industrial Science The University Of Tokyo
関連論文
- Tradeoffs between Error Performance and Decoding Complexity in Multilevel 8-PSK Codes with UEP Capabilities and Multistage Decoding
- Efficient and Secure Multiparty Generation of Digital Signatures Based on Discrete Logarithms (Special Section on Discrete Mathematics and Its Applications)
- Asymptotic Bounds for Unidirectional Byte Error-Correcting Codes (Special Section on Information Theory and Its Applications)
- Construction Techniques for Error-Control Runlength-Limited Block Codes
- Cryptanalysis of TOYOCRYPT-HS1 Stream Cipher(Special Section on Cryptography and Information Security)
- An Unconditionally Secure Electronic Cash Scheme with Computational Untraceability(Special Section on Cryptography and Information Security)
- Coded Modulation for Satellite Digital Video Broadcasting (Special Section on Information Theory and Its Applications)
- Semantically Secure McEliece Phblic-Key Cryptosystem(Special Section on Cryptography and Information Security)
- Multi-Dimensional Turbo Codes: Performance and Simplified Decoding Structure
- Reliability-Based Decoding Algorithm in Multistage Decoding of Multilevel Codes(Special Section on Information Theory and Its Applications)
- A Fast Automatic Fingerprint Identification Method Based on a Weighted-Mean of Binary Image (Special Section on Information Theory and Its Applications)
- Viterbi Decoding Considering Synchronization Errors (Special Section on Information Theory and Its Applications)