On the bounds and achievability about the ODPC of GRM(2,m)^* over prime fields for increasing message length
From MaRDI portal
Publication:2260787
Abstract: The optimum distance profiles of linear block codes were studied for increasing or decreasing message length while keeping the minimum distances as large as possible, especially for Golay codes and the second-order Reed-Muller codes, etc. Cyclic codes have more efficient encoding and decoding algorithms. In this paper, we investigate the optimum distance profiles with respect to the cyclic subcode chains (ODPCs) of the punctured generalized second-order Reed-Muller codes which were applied in Power Control in OFDM Modulations in channels with synchronization, and so on. For this, two standards are considered in the inverse dictionary order, i.e., for increasing message length. Four lower bounds and upper bounds on ODPC are presented, where the lower bounds almost achieve the corresponding upper bounds in some sense. The discussions are over nonbinary prime field.
Recommendations
- On the bias of Reed-Muller codes over odd prime fields
- Linear codes over \(\mathbb {F}_{q}[x]/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound
- \(m\)-th residue codes with length the product of two odd primes over finite fields
- An Improvement of the Gilbert–Varshamov Bound Over Nonprime Fields
- An improved Bombieri-Weil bound and applications to coding theory
- Optimal bounds for multi-prime -hiding assumption
- Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields
- On the influence of message length in PMAC's security bounds
- Minimal achievable approximation ratio for MAX-MQ in finite fields
- A note on cyclic codes over GR\((p^2,m)\) of length \(p^k\)
Cites work
- A Lower Bound on the Optimum Distance Profiles of the Second-Order Reed–Muller Codes
- Alternating bilinear forms over GF(q)
- Association schemes of quadratic forms
- Blocking sets and low-weight codewords in the generalized Reed-Muller codes
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Cyclic Codes and Sequences: The Generalized Kasami Case
- Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel
- Generalized Reed-Muller codes and power control in OFDM modulation
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3485619 (Why is no real title available?)
- scientific article; zbMATH DE number 3492558 (Why is no real title available?)
- scientific article; zbMATH DE number 3521848 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- 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
- On the Optimum Distance Profiles About Linear Block Codes
- On the second weight of generalized Reed-Muller codes
- Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes
- Polar Codes: Characterization of Exponent, Bounds, and Constructions
- The weight distribution of irreducible cyclic codes with block lengths n₁ ((q^-1)/N)
- The Weight Distribution of Some Irreducible Cyclic Codes
- The weight distributions of some cyclic codes with three or four nonzeros over \(\mathbb F_3\)
- The Weight Distributions of the Duals of Cyclic Codes With Two Zeros
- Weight distribution of some reducible cyclic codes
Cited in
(2)
This page was built for publication: On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260787)
