Art

J-GLOBAL ID：201002226635978920   Reference number：10A1081637

An Improvement of Adaptive Cutting Plane Method for Linear Programming Decoding of Binary Linear Codes

線形計画法を用いた2元線形符号の復号における適応的切除平面法の改良

Author (1)： MURAMATSU JUN (NTT コミュニケーション科学基礎研)
Material： 電子情報通信学会技術研究報告  (IEICE Technical Report (Institute of Electronics, Information and Communication Engineers))
Volume： 110  Issue： 205(IT2010 34-50)  Page： 37-42  Publication year： Sep. 14, 2010 
JST Material Number： S0532B  ISSN： 0913-5685  Document type： Proceedings
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： symmetrical channel ,  *linear code ,  *linear programming ,  channel coding ,  Galois field ,  improvement ,  algorithm ,  computational complexity ,  memory capacity ,  constraint condition(restriction) ,  solution(mathematics) ,  integer programming ,  computer simulation ,  objective function ,  error rate ,  *maximum likelihood decoding ,  cutting plane method
Semi thesaurus term： code term ,  performance improvement ,  optimal solution ,  block error rate

JST classification (1)： Code theory  (ND02030R)

Reference (7)：

• ELIAS, P. Coding for noisy channels. IRE Convention Record. 1955, Part 4, 37-46
• FELDMAN, J. Using linear programming to decode binary linear codes. IEEE Trans. Inform. Theory. 2005, IT-51, 3, 954-972
• GALLAGER, R. G. Low density parity check codes. IRE Trans. Inform. Theory. 1962, IT-8, 21-28
• KSCHISCHANG, F. R. Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory. 2001, 47, 2, 498-519
• MIWA, M. A cutting plane method based on redundant rows for improving fractional distance. IEEE J. Selected Areas in Comm. 2009, 27, 6, 1005-1012

Terms in the title (5)： 線形計画法 ,  線形符号 ,  復号 ,  適応 ,  切除平面法