Author of the publication

Ultra-small block-codes for binary discrete memoryless channels.

, , and . ITW, page 175-179. IEEE, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Weak Flip Codes and their Optimality on the Binary Erasure Channel., , and . IEEE Trans. Information Theory, 64 (7): 5191-5218 (2018)Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes., , , and . IEEE Trans. Information Theory, 65 (7): 4243-4273 (2019)The r-wise hamming distance and its operational interpretation for block codes., , and . CISS, page 1-6. IEEE, (2018)Equidistant codes meeting the Plotkin bound are Not optimal on the binary symmetric channel., , and . ISIT, page 3015-3019. IEEE, (2013)The asymptotic capacity of noncoherent single-input multiple-output fading channels with memory and feedback., , and . ISIT, page 2269-2273. IEEE, (2013)Ultra-small block-codes for binary discrete memoryless channels., , and . ITW, page 175-179. IEEE, (2011)Weak flip codes and applications to optimal code design on the binary erasure channel., , and . Allerton Conference, page 160-167. IEEE, (2012)Optimal Byzantine attack for distributed inference with M-ary quantized data., , , and . ISIT, page 2474-2478. IEEE, (2016)Nonlinear codes outperform the best linear codes on the binary erasure channel., , and . ISIT, page 1751-1755. IEEE, (2015)Achieving Private Information Retrieval Capacity in Distributed Storage Using an Arbitrary Linear Code., , , and . CoRR, (2017)