Abstract
The famous Barnes–Wall lattices can be obtained by applying Construction D to a chain of Reed–Muller codes. By applying Construction <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\text {D}}^{\text {(cyc)}}$ </tex-math></inline-formula> to a chain of extended cyclic codes sandwiched between Reed–Muller codes, Hu and Nebe (J. London Math. Soc. <xref ref-type="disp-formula" rid="deqn2" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(2)</xref> 101 (2020) 1068-1089) constructed new series of universally strongly perfect lattices sandwiched between Barnes–Wall lattices. In this paper, we first extend their construction to generalized Reed–Muller codes, and then explicitly determine the minimum vectors of those new sandwiched Reed–Muller codes for some special cases.
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 callDisclaimer: 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.
