Abstract
Let $GF(l)$ be the Galois field with $l=p^m$ elements where $p$ is a prime number and integer $m\geq 1$. Here, we present three constructions for linear codes over $GF(l)$ (depending on the parity of $l$) by using the quadratic residue approach and obtain some sufficient conditions for these codes to be LCD with respect to the Euclidean and Hermitian inner products, respectively. Furthermore, several examples of codes, including optimal and near to optimal codes, are provided to support our study.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Algebra Combinatorics Discrete Structures and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
