A branch-cut-and-price algorithm for optimal decoding in digital communication systems

Volume: 81, Issue: 3, Pages: 805 - 834
Published: Sep 14, 2021
Abstract
Channel coding aims to minimize the errors that occur during the transmission of digital information from one place to another. Low-density parity-check codes can detect and correct transmission errors if one encodes the original information by adding redundant bits. In practice, heuristic iterative decoding algorithms are used to decode the received vector. However, these algorithms may fail to decode if the received vector contains multiple...
Paper Details
Title
A branch-cut-and-price algorithm for optimal decoding in digital communication systems
Published Date
Sep 14, 2021
Volume
81
Issue
3
Pages
805 - 834
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.