Farkas et al., 2015 - Google Patents
Controlled asynchronism improves error exponentFarkas et al., 2015
View PDF- Document ID
- 14706026515893763427
- Author
- Farkas L
- Kói T
- Publication year
- Publication venue
- 2015 IEEE International Symposium on Information Theory (ISIT)
External Links
Snippet
Improved exponential error bounds are derived for frame-asynchronous discrete memoryless multiple access channels with two senders. By numerical evaluation for a particular case, it follows that the best error exponent known for synchronous transmission …
- 230000001360 synchronised 0 abstract description 15
Classifications
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0041—Arrangements at the transmitter end
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
- H03M13/2739—Permutation polynomial interleaver, e.g. quadratic permutation polynomial [QPP] interleaver and quadratic congruence interleaver
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/65—Purpose and implementation aspects
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
- H03M13/2742—Irregular interleaver wherein the permutation pattern is not obtained by a computation rule, e.g. interleaver based on random generators
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M1/00—Analogue/digital conversion; Digital/analogue conversion
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03K—PULSE TECHNIQUE
- H03K3/00—Circuits for generating electric pulses; Monostable, bistable or multistable circuits
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hayashi | Information spectrum approach to second-order coding rate in channel coding | |
| Shayevitz et al. | On the capacity of the discrete memoryless broadcast channel with feedback | |
| Honary et al. | Trellis decoding of block codes: A practical approach | |
| Mondelli et al. | How to achieve the capacity of asymmetric channels | |
| Zhong et al. | LDGM codes for channel coding and joint source-channel coding of correlated sources | |
| Bakshi et al. | Concatenated polar codes | |
| Mondelli et al. | How to achieve the capacity of asymmetric channels | |
| Tan et al. | Optimal cyclic locally repairable codes via cyclotomic polynomials | |
| Farkas et al. | Controlled asynchronism improves error exponent | |
| Cao et al. | Using list decoding to improve the finite-length performance of sparse regression codes | |
| Yuan et al. | Near-optimal generalized decoding of polar-like codes | |
| Sun et al. | Analysis of polarization-adjusted convolutional codes (PAC): A source-channel coding method | |
| Zhang et al. | Best binary equivocation code construction for syndrome coding | |
| Zhou et al. | Distributed block arithmetic coding for equiprobable sources | |
| Matloub et al. | Universal zero-delay joint source–channel coding | |
| Bondaschi et al. | A revisitation of low-rate bounds on the reliability function of discrete memoryless channels for list decoding | |
| US20100299579A1 (en) | Methods and Systems for Error-Correction in Convolutional and Systematic Convolutional Decoders in Galois Configuration | |
| Al-Hassan et al. | New best equivocation codes for syndrome coding | |
| Csiszár et al. | Error exponents for asynchronous multiple access channels, controlled asynchronism may outperform synchronism | |
| Balakirsky | Joint source-channel coding using variable-length codes | |
| Zheng et al. | PAC Codes for Source and Joint Source-Channel Coding | |
| Swart | Distance-preserving mappings and trellis codes with permutation sequences | |
| Farkas | Trellis code error exponent from results for asynchronous multiple access channels | |
| Bondaschi et al. | Revisiting zero-rate bounds on the reliability function of discrete memoryless channels | |
| Tunuguntula | Polar codes for data storage and communication network applications |