Simple Gallager codes for BSC

Yoshiyuki Kabashima, David Saad

Research output: Chapter in Book/Published conference outputChapter


We investigate the performance of Gallager type error- correcting codes for Binary Symmetric Channels, where the code word comprises products of K bits selected from the original message and decoding is carried out utilizing a connectivity tensor with C connections per index. Shannon's bound for the channel capacity is recovered for large K and zero temperature when the code rate K/C is finite. Close to optimal error-correcting capability, with improved decoding properties is obtained for finite K and C.
Original languageEnglish
Title of host publicationProceedings of the international workshop on soft computing in industry '99
Number of pages5
ISBN (Print)4990048911
Publication statusPublished - Jun 1999
EventProceedings of the International Workshop on Soft Computing in Industry, 99 -
Duration: 1 Jun 19991 Jun 1999


WorkshopProceedings of the International Workshop on Soft Computing in Industry, 99


  • Gallager type error
  • correcting codes
  • Binary Symmetric Channels
  • connectivity tensor
  • Shannon's bound
  • optimal error-correcting capability
  • decoding


Dive into the research topics of 'Simple Gallager codes for BSC'. Together they form a unique fingerprint.

Cite this