Computing extensions of linear codes using a greedy algorithm
10.1109/ISIT.2012.6283537
Saved in:
Main Authors: | Grassl, M., Han, S. |
---|---|
Other Authors: | CENTRE FOR QUANTUM TECHNOLOGIES |
Format: | Conference or Workshop Item |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/112547 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
On greedy codes
by: Bumanglag, Oscar M., Jr.
Published: (2015) -
A greedy algorithm for computing finite-makespan controllable sublanguages
by: Su, Rong.
Published: (2013) -
On greedy algorithms for binary de Bruijn sequences
by: Chang, Zuling, et al.
Published: (2021) -
Packet scheduling based on set covering problem using greedy algorithm
by: Chatchanan Jandaeng
Published: (2014) -
G-PRIMER: Greedy algorithm for selecting minimal primer set
by: Wang, J., et al.
Published: (2013)