Abstract
We show that the generalized -ary MacDonald codes with parameters are two-weight codes with nonzero weights , and determine the complete weight enumerator of these codes. This leads to a family of strongly regular graphs with parameters . Further, we show that the codes satisfy the Griesmer bound and are self-orthogonal for .
Citation
Padmapani Seneviratne. Lauren Melcher. "On generalized MacDonald codes." Involve 11 (5) 885 - 892, 2018. https://doi.org/10.2140/involve.2018.11.885
Information