Opening book details…
About this Computer Science article
An Algorithm for Computing the Minimum Distances of Extensions of BCH Codes Embedded in Semigroup Rings by J. Cazaran; A.V. Kelarev; S.J. Quinn; D. Vertigan is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- J. Cazaran; A.V. Kelarev; S.J. Quinn; D. Vertigan
- Publisher
- Springer; Springer-Verlag; Springer Verlag; Springer Science and Business Media LLC (ISSN 0037-1912)
- Published
- 2006
- Field
- Computer Science (Physical Sciences)
More by J. Cazaran; A.V. Kelarev; S.J. Quinn; D. Vertigan
Browse all works by J. Cazaran; A.V. Kelarev; S.J. Quinn; D. Vertigan