{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:59:48Z","timestamp":1729645188058,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1109\/itw.2008.4578615","type":"proceedings-article","created":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T11:39:21Z","timestamp":1217590761000},"page":"26-30","source":"Crossref","is-referenced-by-count":1,"title":["Gallager-Type Bounds for Non-Binary Linear Block Codes over Memoryless Symmetric Channels"],"prefix":"10.1109","author":[{"given":"Eran","family":"Hof","sequence":"first","affiliation":[]},{"given":"Igal","family":"Sason","sequence":"additional","affiliation":[]},{"given":"Shlomo","family":"Shamai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838090"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2008.4578615"},{"article-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"ref12"},{"article-title":"Principle of digital communication and coding","year":"1979","author":"viterbi","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805064"},{"key":"ref15","first-page":"1","article-title":"A simple tight bound on error probability of block codes with application to turbo codes","author":"divsalar","year":"1999","journal-title":"JPL The Telecommun and Mission Operations Progress Rep"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","article-title":"Low-density parity-check codes","author":"gallager","year":"1963"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.224"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/26.681398"},{"journal-title":"Turbo codes and turbo-coded modulation systems Analysis and performance bounds","year":"1998","author":"duman","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824917"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.782147"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920216"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb03905.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0100000009","article-title":"Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial","volume":"3","author":"sason","year":"2006","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"}],"event":{"name":"2008 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2008,5,5]]},"location":"Porto","end":{"date-parts":[[2008,5,9]]}},"container-title":["2008 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4563626\/4578607\/04578615.pdf?arnumber=4578615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:01:37Z","timestamp":1557702097000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4578615\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/itw.2008.4578615","relation":{},"subject":[],"published":{"date-parts":[[2008,5]]}}}