The relations between binary Reed-Muller codes and cyclic codes
スポンサーリンク
概要
- 論文の詳細を見る
First we introduce a different representation of binary Reed-Muller codes. In consequence, we describe clearly the relations between binary Reed-Muller codes and binary cyclic codes, and prove them easily and directly.
- お茶の水女子大学の論文
著者
-
Koyama Toshiko
Department Of Information Sciences Ochanomizu University
-
Koyama Toshiko
Department Of Information Sciences Faculty Of Science Ochanomizu University
関連論文
- Combined Antitumor Activity of 7-Hydroxystaurosporine (UCN-O1) and Tamoxifen against Human Breast Carcinoma in Vitro and in Vivo
- On Regular Graphs and the Associated Real Algebras Generated by the Adjacency Matrices
- On a Characterization of Quasi-Complete p-Groups
- On p-indicators in Ext (Q/Z, T) with Infinitely Many Gaps
- On Some Torsion-free Classes
- On a Torsion-free Class with Separable Types
- On Applications of the Bruck-Ryser-Chowla Theorem
- A Proof to Dieudonne's Theorem on Infinite Abelian p-groups
- The relations between binary Reed-Muller codes and cyclic codes