Concentration of Magnetization for Linear Block Codes
Related publications (116)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
The theory and practice of digital communication during the past 50 years has been strongly influenced by Shannon's separation theorem. While it is conceptually and practically appealing to separate source from channel coding, either step requires infinite ...
Proposes some simple algorithms for decoding BCH codes. The authors show that the pruned FFT is an effective method for evaluating syndromes and for finding the roots of error-locator polynomials. They show that a simple variation of the basic Gaussian eli ...
Communication over unknown binary symmetric channels with instantaneous and perfect feedback is considered. We describe a universal scheme based on a decision feedback strategy. ...
Communication over unknown binary symmetric channels with instantaneous and perfect feedback is considered. We describe a universal scheme based on a decision feedback strategy. ...
When is uncoded transmission optimal? This paper derives easy-to-check necessary and sufficient conditions that do not require finding the rate-distortion and the capacity-cost functions. We consider the symbol-by-symbol communication of discrete-time memo ...
For certain fortunate choices of source/channel pairs, all sophisticated coding is in vain: for them, a code of block length one is sufficient to achieve optimal performance \cite{mgbrmvtrans}. Is the set of ``fortunate choices'' larger if we allow for cod ...