2 search results - page 1 / 1 » Bounds for the Multicovering Radii of Reed-Muller Codes with... |
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
TIT
2008
13 years 4 months ago
2008
The nonlinearity profile of a Boolean function (i.e. the sequence of its minimum Hamming distances nlr(f) to all functions of degrees at most r, for r 1) is a cryptographic crite...