How to compute the minimum distance for cyclic AN-codes over an arbitrary base I. Elementary methods
From MaRDI portal
Publication:3901440
DOI10.1016/S0019-9958(80)90774-3zbMath0453.94021MaRDI QIDQ3901440
No author found.
Publication date: 1980
Published in: Information and Control (Search for Journal in Brave)
Related Items (1)
This page was built for publication: How to compute the minimum distance for cyclic AN-codes over an arbitrary base I. Elementary methods