Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2019

Dates and versions

hal-02318246 , version 1 (16-10-2019)

Identifiers

Cite

Anand Kumar Narayanan, Matthew Weidner. Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound. IEEE Transactions on Information Theory, 2019, 65 (10), pp.6010-6021. ⟨10.1109/TIT.2019.2930538⟩. ⟨hal-02318246⟩
48 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More