On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length
From MaRDI portal
Publication:2260787
DOI10.1007/s10623-013-9877-5zbMath1342.94116arXiv1307.0927OpenAlexW2091877955MaRDI QIDQ2260787
Publication date: 12 March 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.0927
Related Items
The weight distributions of some cyclic codes with three or four nonzeros over \(\mathbb F_3\), The weight distributions of a class of cyclic codes with three nonzeros over \(\mathbb{F}_3\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The weight distributions of some cyclic codes with three or four nonzeros over \(\mathbb F_3\)
- On the second weight of generalized Reed-Muller codes
- Association schemes of quadratic forms
- Alternating bilinear forms over GF(q)
- The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
- Weight distribution of some reducible cyclic codes
- Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel
- Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes
- Generalized Reed-Muller codes and power control in OFDM modulation
- The Weight Distribution of Some Irreducible Cyclic Codes
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- The Weight Distributions of the Duals of Cyclic Codes With Two Zeros
- Polar Codes: Characterization of Exponent, Bounds, and Constructions
- A Lower Bound on the Optimum Distance Profiles of the Second-Order Reed–Muller Codes
- Cyclic Codes and Sequences: The Generalized Kasami Case
- On the Optimum Distance Profiles About Linear Block Codes
- New generalizations of the Reed-Muller codes--I: Primitive codes
- New generalizations of the Reed-Muller codes--II: Nonprimitive codes
- On generalized ReedMuller codes and their relatives