1![Computing the minimal distance of cyclic codes Jos´ e Felipe Voloch Abstract: We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes. Keywords: cyclic codes, Computing the minimal distance of cyclic codes Jos´ e Felipe Voloch Abstract: We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes. Keywords: cyclic codes,](https://www.pdfsearch.io/img/f70f347e1cca3fdf4379953f4a3d728e.jpg) | Add to Reading ListSource URL: www.ma.utexas.eduLanguage: English - Date: 2004-10-22 18:26:34
|
---|
2![Automorphism groups of extremal self-dual binary linear codes Martino Borello Università degli Studi di Milano-Bicocca The 11 Automorphism groups of extremal self-dual binary linear codes Martino Borello Università degli Studi di Milano-Bicocca The 11](https://www.pdfsearch.io/img/01c587ea58c774820b2a4dbddb7c809e.jpg) | Add to Reading ListSource URL: www.math.uni-magdeburg.deLanguage: English - Date: 2013-08-06 10:53:07
|
---|
3![794 IEEETRANSACTIONS [I41 T. Kasami, S. Lin, and W. W. Peterso?,.“New generalizations of the Reed-Muller codes-Part I: Pritnltlve codes,” IEEE Trans. 794 IEEETRANSACTIONS [I41 T. Kasami, S. Lin, and W. W. Peterso?,.“New generalizations of the Reed-Muller codes-Part I: Pritnltlve codes,” IEEE Trans.](https://www.pdfsearch.io/img/da07ec35e83a7999cd44bd48a7acd001.jpg) | Add to Reading ListSource URL: neilsloane.comLanguage: English - Date: 2012-04-16 01:14:54
|
---|
4![arXiv:1106.5530v2 [math.GR] 30 Jun[removed]Non-PORC behaviour of a class of descendant p-groups. Marcus du Sautoy and Michael Vaughan-Lee∗ Mathematical Institute arXiv:1106.5530v2 [math.GR] 30 Jun[removed]Non-PORC behaviour of a class of descendant p-groups. Marcus du Sautoy and Michael Vaughan-Lee∗ Mathematical Institute](https://www.pdfsearch.io/img/b818e74a2a397486bec40f1dcb2b24e4.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2011-06-30 21:50:47
|
---|
5![USA Mathematical Talent Search Round 1 Solutions Year 25 — Academic Year 2013–2014 www.usamts.org[removed]Alex is trying to open a lock whose code is a sequence that is three letters long, with USA Mathematical Talent Search Round 1 Solutions Year 25 — Academic Year 2013–2014 www.usamts.org[removed]Alex is trying to open a lock whose code is a sequence that is three letters long, with](https://www.pdfsearch.io/img/ccad5cae01c0804d78d34c8af50fbd2f.jpg) | Add to Reading ListSource URL: www.usamts.orgLanguage: English - Date: 2013-10-18 17:16:02
|
---|
6![USA Mathematical Talent Search Round 1 Solutions Year 25 — Academic Year 2013–2014 www.usamts.org[removed]Alex is trying to open a lock whose code is a sequence that is three letters long, with USA Mathematical Talent Search Round 1 Solutions Year 25 — Academic Year 2013–2014 www.usamts.org[removed]Alex is trying to open a lock whose code is a sequence that is three letters long, with](https://www.pdfsearch.io/img/66ccaa0b14b4c3590a5d907d57baae70.jpg) | Add to Reading ListSource URL: usamts.orgLanguage: English - Date: 2013-10-18 17:16:02
|
---|