英和和英

出典:『Wikipedia』 (2011/06/03 05:37 UTC 版)

英語による解説

引用

In coding theory, Justesen codes form a class of Error detection and correction codes which are derived from Reed-Solomon code and have good error-control properties. In code concatenation, we compose an outer code C_out with an inner code C_in. By using the appropriate outer and inner code C_out and C_in, we can obtain new bound for code, such as Zyablov bound. The Justesen code composes the Reed-Solomon code with the Wonzencraft ensemble and has a strongly explicit construction.Loosely speaking, the code has the strongly explicit construction if we can construct it in log space complexity. Unlike the usual code concatenation, the Justesen code obtains the power by using different linear inner codes as we see below.