4.5 Article

On the Generalized Covering Radii of Reed-Muller Codes

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Information Systems

The Generalized Covering Radii of Linear Codes

Dor Elimelech et al.

Summary: This study introduces the concept of generalized covering radius of linear codes for balancing storage, latency, and access complexity in database systems. It explores the relationship between code parameters and generalized covering radii, as well as the impact of simple code operations.

IEEE TRANSACTIONS ON INFORMATION THEORY (2021)

Article Computer Science, Information Systems

Reed-Muller Codes: Theory and Algorithms

Emmanuel Abbe et al.

Summary: RM codes are one of the oldest and simplest codes in coding theory, which are still under investigation for their important properties. Recent developments have been made in the weight enumerator, capacity-achieving properties, and algorithmic improvements for RM codes. The paper discusses connections between RM codes, thresholds of Boolean functions, polarization theory, hypercontractivity, and techniques for approximating low weight codewords using lower degree polynomials.

IEEE TRANSACTIONS ON INFORMATION THEORY (2021)

Article Computer Science, Information Systems

Reed-Muller Codes Polarize

Emmanuel Abbe et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2020)

Article Computer Science, Information Systems

Reed-Muller Codes Achieve Capacity on Erasure Channels

Shrinivas Kudekar et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2017)

Article Computer Science, Information Systems

Reed-Muller Codes for Random Erasures and Errors

Emmanuel Abbe et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2015)

Article Computer Science, Information Systems

Analysis of affinely equivalent Boolean functions

Meng QingShu et al.

SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES (2007)

Article Computer Science, Information Systems

Complementary sets, generalized Reed-Muller codes, and power control for OFDM

Kai-Uwe Schmidt

IEEE TRANSACTIONS ON INFORMATION THEORY (2007)

Article Computer Science, Information Systems

Improving the upper bounds on the covering radii of binary Reed-Muller codes

Claude Carlet et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2007)

Article Computer Science, Information Systems

On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions

Y Borissov et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2005)

Article Computer Science, Information Systems

New covering radius of Reed-Muller codes for t-resilient functions

K Kurosawa et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2004)

Article Computer Science, Information Systems

Generalized Reed-Muller codes and power control in OFDM modulation

KG Paterson

IEEE TRANSACTIONS ON INFORMATION THEORY (2000)