Abstract
Abstract This paper shows that for every maximum length code of length n = qm; — 1, there exists a corresponding $ symmetric incomplete block design. As a result, an efficient programmable algorithm for the construction of this special class of incomplete block design is obtained. If q is a prime, then only q and m are required as inputs to the computer. If q=ps, the power of a prime, then besides q and m, the primitive polynomial of GF(ps) is also required as inputs to the computer.
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
