Kenji YASUNAGA,Toru FUJIWARA,Tadao KASAMI
Local weight distribution is the weight distribution of minimal codewords in a linear code. We give the local weight distribution of the (256, 93) third-order binary Reed-Muller code. For the computation, a coset partitioning algorithm is modified by using a binary shift invariance property. This reduces the time complexity by about 1/256 for the code. A necessary and sufficient condition for minimality in Reed-Muller codes is also presented.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. SeeIEICE Provisions on Copyright for details.
Copy
Kenji YASUNAGA, Toru FUJIWARA, Tadao KASAMI, "Local Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code" in IEICE TRANSACTIONS on Fundamentals, vol. E90-A, no. 3, pp. 698-701, March 2007, doi:10.1093/ietfec/e90-a.3.698.
Abstract:Local weight distribution is the weight distribution of minimal codewords in a linear code. We give the local weight distribution of the (256, 93) third-order binary Reed-Muller code. For the computation, a coset partitioning algorithm is modified by using a binary shift invariance property. This reduces the time complexity by about 1/256 for the code. A necessary and sufficient condition for minimality in Reed-Muller codes is also presented.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.3.698/_p
Copy
@ARTICLE{e90-a_3_698,
author={Kenji YASUNAGA, Toru FUJIWARA, Tadao KASAMI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Local Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code},
year={2007},
volume={E90-A},
number={3},
pages={698-701},
abstract={Local weight distribution is the weight distribution of minimal codewords in a linear code. We give the local weight distribution of the (256, 93) third-order binary Reed-Muller code. For the computation, a coset partitioning algorithm is modified by using a binary shift invariance property. This reduces the time complexity by about 1/256 for the code. A necessary and sufficient condition for minimality in Reed-Muller codes is also presented.},
keywords={},
doi={10.1093/ietfec/e90-a.3.698},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - Local Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 698
EP - 701
AU - Kenji YASUNAGA
AU - Toru FUJIWARA
AU - Tadao KASAMI
PY - 2007
DO -10.1093/ietfec/e90-a.3.698
JO - IEICE TRANSACTIONS on Fundamentals
SN -1745-1337
VL - E90-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2007
AB -Local weight distribution is the weight distribution of minimal codewords in a linear code. We give the local weight distribution of the (256, 93) third-order binary Reed-Muller code. For the computation, a coset partitioning algorithm is modified by using a binary shift invariance property. This reduces the time complexity by about 1/256 for the code. A necessary and sufficient condition for minimality in Reed-Muller codes is also presented.
ER -