Abstract
We construct a family of linear codes of lengthN=( m n )(q-1) m-1 and of dimensionn (orn?1) overGF(q). Their minimum distance and their weight distribution are calculated. These codes are subschemes of the hypercubic association schemeH(N,q).
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
