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.
Recent work has shown that for some multi-user networks, carefully controlling the algebraic structure of the coding scheme may be just as useful as selecting the correct input distribution. In particular, for linear channel models, including finite field ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given node degree distri ...
Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low Density Parity Check (LDPC) codes, we need to have the minimum distance grow fast with n, the codelength. However, the best we can hope for ...
We propose and demonstrate a reconfigurable tunable encoder for two-dimensional time–wavelength optical code division multiple access (OCDMA). This encoder is capable of creating 2D codes with variable code weight, enabling differentiated service provision ...
We consider communication over the binary erasure and the binary additive white gaussian noise channels using fixed linear block codes and also appropriate ensembles of such codes. We show concentration of the magnetization over the channel realizations an ...
Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matric ...
Signal processing algorithms become more and more complex and the algorithm architecture adaptation and design processes cannot any longer rely only on the intuition of the designers to build efficient systems. Specific tools and methods are needed to cope ...
We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding schemes of arbi- trary complexity, but the intermediate relay nodes are restricted to process only ...
Institute of Electrical and Electronics Engineers2007
It is well-known that random error-correcting codes achieve the Gilbert-Varshamov bound with high probability. In [2], the authors describe a construction which can be used to yield a polynomially large family of codes of which a large fraction achieve the ...
This work is concerned with codes, graphs and their links. Graph based codes have recently become very prominent in both information theory literature and practical applications. While most research has centered around their performance under iterative dec ...
