The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Propomos um algoritmo recursivo para reduzir a complexidade computacional do r-ordem não linearidade de n-funções booleanas variáveis. Aplicando o algoritmo e usando a condição suficiente e necessária apresentada por [1] para cortar a grande maioria dos ramos de busca inúteis, mostramos que o raio de cobertura do Código Reed-Muller R(3, 7) em R(5, 7) é 20.
Gui LI
Xiangtan University
Qichun WANG
Nanjing Normal University
Shi SHU
Xiangtan University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Gui LI, Qichun WANG, Shi SHU, "The Covering Radius of the Reed-Muller Code R(3, 7) in R(5, 7) Is 20" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 3, pp. 594-597, March 2019, doi: 10.1587/transfun.E102.A.594.
Abstract: We propose a recursive algorithm to reduce the computational complexity of the r-order nonlinearity of n-variable Boolean functions. Applying the algorithm and using the sufficient and necessary condition put forward by [1] to cut the vast majority of useless search branches, we show that the covering radius of the Reed-Muller Code R(3, 7) in R(5, 7) is 20.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.594/_p
Copiar
@ARTICLE{e102-a_3_594,
author={Gui LI, Qichun WANG, Shi SHU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Covering Radius of the Reed-Muller Code R(3, 7) in R(5, 7) Is 20},
year={2019},
volume={E102-A},
number={3},
pages={594-597},
abstract={We propose a recursive algorithm to reduce the computational complexity of the r-order nonlinearity of n-variable Boolean functions. Applying the algorithm and using the sufficient and necessary condition put forward by [1] to cut the vast majority of useless search branches, we show that the covering radius of the Reed-Muller Code R(3, 7) in R(5, 7) is 20.},
keywords={},
doi={10.1587/transfun.E102.A.594},
ISSN={1745-1337},
month={March},}
Copiar
TY - JOUR
TI - The Covering Radius of the Reed-Muller Code R(3, 7) in R(5, 7) Is 20
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 594
EP - 597
AU - Gui LI
AU - Qichun WANG
AU - Shi SHU
PY - 2019
DO - 10.1587/transfun.E102.A.594
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2019
AB - We propose a recursive algorithm to reduce the computational complexity of the r-order nonlinearity of n-variable Boolean functions. Applying the algorithm and using the sufficient and necessary condition put forward by [1] to cut the vast majority of useless search branches, we show that the covering radius of the Reed-Muller Code R(3, 7) in R(5, 7) is 20.
ER -