Non-linear cyclic codes that attain the Gilbert-Varshamov bound

Ishay Haviv; Michael Langberg; Moshe Schwartz; Eitan Yaakobi

doi:10.1109/ISIT.2017.8006595

Non-linear cyclic codes that attain the Gilbert-Varshamov bound

Ishay Haviv, Michael Langberg, Moshe Schwartz, Eitan Yaakobi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We prove that there exist non-linear binary cyclic codes that attain the Gilbert-Varshamov bound.

Original language	English
Title of host publication	2017 IEEE International Symposium on Information Theory, ISIT 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	586-588
Number of pages	3
ISBN (Electronic)	9781509040964
DOIs	https://doi.org/10.1109/ISIT.2017.8006595
State	Published - 9 Aug 2017
Externally published	Yes
Event	2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: 25 Jun 2017 → 30 Jun 2017

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/Territory	Germany
City	Aachen
Period	25/06/17 → 30/06/17

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

Keywords

Cyclic codes
Gilbert-Varshamov bound
Good family of codes
Non-linear codes

Access to Document

10.1109/ISIT.2017.8006595

Cite this

Haviv, I., Langberg, M., Schwartz, M., & Yaakobi, E. (2017). Non-linear cyclic codes that attain the Gilbert-Varshamov bound. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 586-588). Article 8006595 (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8006595

@inproceedings{30854631926a4592b2af33100ce58d69,

title = "Non-linear cyclic codes that attain the Gilbert-Varshamov bound",

abstract = "We prove that there exist non-linear binary cyclic codes that attain the Gilbert-Varshamov bound.",

keywords = "Cyclic codes, Gilbert-Varshamov bound, Good family of codes, Non-linear codes",

author = "Ishay Haviv and Michael Langberg and Moshe Schwartz and Eitan Yaakobi",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",

year = "2017",

month = aug,

day = "9",

doi = "10.1109/ISIT.2017.8006595",

language = "אנגלית",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "586--588",

booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",

address = "ארצות הברית",

}

Haviv, I, Langberg, M, Schwartz, M & Yaakobi, E 2017, Non-linear cyclic codes that attain the Gilbert-Varshamov bound. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006595, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 586-588, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 25/06/17. https://doi.org/10.1109/ISIT.2017.8006595

Non-linear cyclic codes that attain the Gilbert-Varshamov bound. / Haviv, Ishay; Langberg, Michael; Schwartz, Moshe et al.
2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 586-588 8006595 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Non-linear cyclic codes that attain the Gilbert-Varshamov bound

AU - Haviv, Ishay

AU - Langberg, Michael

AU - Schwartz, Moshe

AU - Yaakobi, Eitan

PY - 2017/8/9

Y1 - 2017/8/9

N2 - We prove that there exist non-linear binary cyclic codes that attain the Gilbert-Varshamov bound.

AB - We prove that there exist non-linear binary cyclic codes that attain the Gilbert-Varshamov bound.

KW - Cyclic codes

KW - Gilbert-Varshamov bound

KW - Good family of codes

KW - Non-linear codes

UR - https://www.scopus.com/pages/publications/85034021057

U2 - 10.1109/ISIT.2017.8006595

DO - 10.1109/ISIT.2017.8006595

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85034021057

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 586

EP - 588

BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017

Y2 - 25 June 2017 through 30 June 2017

ER -

Non-linear cyclic codes that attain the Gilbert-Varshamov bound

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this