2017
DOI: 10.1109/tit.2017.2673827
|View full text |Cite
|
Sign up to set email alerts
|

Spherically Punctured Reed-Muller Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…As we already explained, the algebraic immunity when G is a power function being not very good, we tried functions G of the form G(y) = y d + y −1 . We obtained the following results: n AI(f F ) 8 4 10 5 12 5 14 6 16 6…”
mentioning
confidence: 81%
“…As we already explained, the algebraic immunity when G is a power function being not very good, we tried functions G of the form G(y) = y d + y −1 . We obtained the following results: n AI(f F ) 8 4 10 5 12 5 14 6 16 6…”
mentioning
confidence: 81%
“…Reed Muller codes RM (r, n) are binary codes of length 2 n whose codewords are the evaluations of all Boolean functions of algebraic degree at most r in n variables on their 2 n entries. Fixing the Hamming weight to the entries to k gives the spherically punctured Reed-Muller codes studied by Kapralova and Dumer [DK13,DK17]. The properties of these codes are connected to Boolean functions with fixed weight entries.…”
Section: Spherically Punctured Reed-muller Codesmentioning
confidence: 99%