|
Optimal linear error-block codes |
|---|---|
| รหัสดีโอไอ | |
| Title | Optimal linear error-block codes |
| Creator | Somphong Jitman |
| Contributor | Patanee Udomkavanich |
| Publisher | Chulalongkorn University |
| Publication Year | 2549 |
| Keyword | Mathematical statistics, Linear models (Statistics), Error analysis (Mathematics), คณิตศาสตร์สถิติ, แบบจำลองเชิงเส้น, การวิเคราะห์ความคลาดเคลื่อน (คณิตศาสตร์) |
| Abstract | In 2006, K. Feng, L. Xu and F. J. Hickernell initiated the concept of a linear error-block code which is a natural generalization of the classical linear code. In this thesis, we investigate optimal linear error-block codes in two directions : maximal dimension codes and maximal minimum [pi]-distance codes. First perspective on optimizing a code is by studying lower bounds and upper bounds on dimension of a code. The various bounds developed in this research provide tools used in obtaining more efficient codes which in some cases lead to optimal codes. The later approach is by modifying suitable existing linear error-black codes so that the optimal ones are rewarded. |
| URL Website | cuir.car.chula.ac.th |
