A Probabilistic Algorithm for Determining the Minimum Weight of Cyclic Codes (Special Section on Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
A method is presented for determining the minimum weight of cyclic codes. It is a probabilistic algorithm. this algorithm is used to find, the minimum weight of codes far too large to be treated by any known algorithm. It is based on a probabilistic algorithm for determining the minimum weight of linear code by Jeffrey S. Leon. By using this method, the minimum weight of cyclic codes is computed efficiently.
- 社団法人電子情報通信学会の論文
- 1998-10-25
著者
-
Morii Masakatu
Department Of Computer Science Ehime University
-
Mohri M
Univ. Tokushima Tokushima‐shi Jpn
-
MOHRI Masami
Department of Management and Information Processing, Kagawa Junior College
関連論文
- Reversible Watermark with Large Capacity Based on the Prediction Error
- New Key Generation Algorithm for RSA Cryptosystem (Special Section on Cryptography and Information Security)
- A Method for Improving Fast Correlation Attack Using Parity Check Equations Modifications (Information Security)
- A Probabilistic Algorithm for Determining the Minimum Weight of Cyclic Codes (Special Section on Information Theory and Its Applications)
- On the Reliability for the Weight Distribution of LDPC codes Computed by the Probabilistic Algorithm(HISC2006)
- Special Section on Cryptography and Information Security
- Revocable Network Coding Scheme for Specific Networks
- Reversible Watermark Based on Adaptive Embedding
- Invertibility of Functions Involving Circular Shift Operations and the Construction of Hash Functions