Rate Region of the (4,3,3) Exact-Repair Regenerating Codes Conference Paper

abstract

• Exact-repair regenerating codes are considered for the case (n, k, d) = (4, 3,3), for which a complete characterization of the rate region is provided. This characterization answers in the affirmative the open question whether there exists a non-vanishing gap between the optimal bandwidth-storage tradeoff of the functional-repair regenerating codes (i.e., the cut-set bound) and that of the exact-repair regenerating codes. The converse proof relies on the existence of symmetric optimal solutions. For the achievability, only one non-trivial corner point of the rate region needs to be addressed, for which an explicit binary code construction is given. 2013 IEEE.

name of conference

• 2013 IEEE International Symposium on Information Theory

authors

• Tian, Chao

published proceedings

• 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)

author list (cited authors)

• Tian, C.

citation count

• 34

complete list of authors

• Tian, Chao

publication date

• July 2013

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

Digital Object Identifier (DOI)

• 10.1109/isit.2013.6620462

International Standard Book Number (ISBN) 13

• 9781479904464

start page

• 1426

end page

• 1430

URL

• http://dx.doi.org/10.1109/isit.2013.6620462