✦ LIBER ✦

Finding Good Linear Codes Using a Simple Extension Algorithm

✍ Scribed by Sunghyu Han

Book ID: 114642628
Publisher: IEEE
Year: 2011
Tongue: English
Weight: 959 KB
Volume: 57
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2011.2132114

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Heuristic Algorithm for the Constructi

A Heuristic Algorithm for the Construction of Good Linear Codes

✍ Zwanzger, J. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 202 KB

Linear expected time of a simple union-f

Linear expected time of a simple union-find algorithm

✍ Jon Doyle; Ronald L. Rivest 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 446 KB

A simple linear expected time algorithm

A simple linear expected time algorithm for finding a hamilton path

✍ Andrew Thomason 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Discrete Mathematics 75 (1989) 373-379 North-Holland n?", so the problem is one of finding a fast algorithm which works on all graphs in %(n, p) except for a proportion somewhat smaller than 2~". This will be our algorithm A2. A very fast algorithm, which works on most graphs but not on as many as A

A simple algorithm for finding all solut

A simple algorithm for finding all solutions of piecewise-linear networks

✍ Huang, Q.; Liu, R.-W. 📂 Article 📅 1989 🏛 IEEE ⚖ 752 KB

A linear algorithm for finding the conve

A linear algorithm for finding the convex hull of a simple polygon

✍ Duncan McCallum; David Avis 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 759 KB

A simple linear-time algorithm for findi

A simple linear-time algorithm for finding path-decompositions of small width

✍ Kevin Cattell; Michael J. Dinneen; Michael R. Fellows 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 601 KB