Computing extensions of linear codes using a greedy algorithm

10.1109/ISIT.2012.6283537

Saved in:

Bibliographic Details
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

id	sg-nus-scholar.10635-112547
record_format	dspace
spelling	sg-nus-scholar.10635-1125472015-02-04T06:53:27Z Computing extensions of linear codes using a greedy algorithm Grassl, M. Han, S. CENTRE FOR QUANTUM TECHNOLOGIES 10.1109/ISIT.2012.6283537 IEEE International Symposium on Information Theory - Proceedings 1568-1572 PISTF 2014-11-28T05:02:40Z 2014-11-28T05:02:40Z 2012 Conference Paper Grassl, M.,Han, S. (2012). Computing extensions of linear codes using a greedy algorithm. IEEE International Symposium on Information Theory - Proceedings : 1568-1572. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/ISIT.2012.6283537" target="_blank">https://doi.org/10.1109/ISIT.2012.6283537</a> 9781467325790 http://scholarbank.nus.edu.sg/handle/10635/112547 NOT_IN_WOS Scopus
institution	National University of Singapore
building	NUS Library
country	Singapore
collection	ScholarBank@NUS
description	10.1109/ISIT.2012.6283537
author2	CENTRE FOR QUANTUM TECHNOLOGIES
author_facet	CENTRE FOR QUANTUM TECHNOLOGIES Grassl, M. Han, S.
format	Conference or Workshop Item
author	Grassl, M. Han, S.
spellingShingle	Grassl, M. Han, S. Computing extensions of linear codes using a greedy algorithm
author_sort	Grassl, M.
title	Computing extensions of linear codes using a greedy algorithm
title_short	Computing extensions of linear codes using a greedy algorithm
title_full	Computing extensions of linear codes using a greedy algorithm
title_fullStr	Computing extensions of linear codes using a greedy algorithm
title_full_unstemmed	Computing extensions of linear codes using a greedy algorithm
title_sort	computing extensions of linear codes using a greedy algorithm
publishDate	2014
url	http://scholarbank.nus.edu.sg/handle/10635/112547
_version_	1681094505235742720

Computing extensions of linear codes using a greedy algorithm

Similar Items