Abstract
Trace codes over a cubic ring extension of the binary field are constructed by using a triple of simplicial complexes. A linear Gray map yields several infinite families of binary few-weight codes which can have as many as 9 weights. By equating two complexes in the triple, we obtain binary three-weight codes, which are minimal and distance optimal.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
