๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A simple linear expected time algorithm
โœ 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