Abstract
In this paper, we construct new infinite families of codes over the ring R=F2+uF2+vF2+uvF2,u2=v2=0,uv=vu by employing simplicial complexes. When the simplicial complexes are all generated by a single maximal element, we compute the Lee weight distributions of these classes of codes. By the Gray map, we show that some classes of codes are minimal and some classes of these codes are distance optimal.
Sign-in/Register to access full text options 
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.
