Test Whats new message.
Scheduled Maintenance on Monday 1/13/2025
Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.
Showing 1-25 of 10,954 resultsfor "Index Terms":Codeword Length
"Index Terms":Codeword Length
- Sort
Get notified when new research is published matching your search criteria.
Sort By
Results
Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels
2007 International Symposium on Signals, Circuits and Systems
Year: 2007 | Conference Paper |
Cited by: Papers (4)
Performance evaluation of phase shift keying modulation technique using BCH code, Cyclic code and Hamming code through AWGN channel model in communication system
Suzi Seroja Sarnin;Nani Fadzlina Nairn;Wan Nor Syafizan W. Muhamad
The 3rd International Conference on Information Sciences and Interaction Sciences
Year: 2010 | Conference Paper |
Cited by: Papers (6)
This paper presents the performance evaluation of phase shift keying technique modulation such as BPSK and QPSK using error correcting code. Three error correcting codes types; Bose-Chaudhuri-Hocquenghem (BCH) code, Cyclic code and Hamming code were used as the encoder/decoder technique to calculate the bit error rate through an Additive White Gaussian Noise (AWGN) channel. Basically, the performa...Show More
The Construction of Variable Length Codes With Good Synchronization Properties
Variable length codes offer advantages for data compression, but are susceptible to loss of synchronization if a bit error occurs. This can be mitigated by the use of variable length codes with specific mechanisms for resynchronization. Such mechanisms exist in the codes known as Huffman Equivalent (HE) codes and T-codes. These have been extensively studied in the literature. For optimal compressi...Show More
Third-Order Asymptotics of Variable-Length Compression Allowing Errors
This study investigates the fundamental limits of variable-length compression in which prefix-free constraints are not imposed (i.e., one-to-one codes are studied) and non-vanishing error probabilities are permitted. Due in part to a crucial relation between the variable-length and fixed-length compression problems, our analysis requires a careful and refined analysis of the fundamental limits of ...Show More
Non-Asymptotic Bounds of Cumulant Generating Function of Codeword Lengths in Variable-Length Lossy Compression
This paper investigates the problem of variable-length source coding with the criteria of the normalized cumulant generating function of codeword lengths and the excess distortion probability. We analyze the non-asymptotic fundamental limit of the normalized cumulant generating function of codeword lengths under the constraint that the excess distortion probability is allowed up to $\epsilon \in ...Show More
On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources
Given a discrete memoryless source X, it is well known that the expected codeword length per symbol L n(X) of an optimal prefix code for the extended source X n converges to the source entropy as n approaches infinity. However, the sequence L n(X) need not be monotonic in n , which implies that the coding efficiency cannot be increased by simply encoding a larger block of source symbols (unless th...Show More
Dynamic Sliding Window Encoding for Data Storage on DNA Under Biological and Indexing Constraints
Chloé Berton;Gouenou Coatrieux;Dominique Lavenier;Sahar Haddad
2023 31st European Signal Processing Conference (EUSIPCO)
Year: 2023 | Conference Paper |
In this paper, we propose a first dynamic sliding window encoding (DSWE) for storing encrypted data in a DNA form taking into account biological constraints and prohibited nucleotide motifs used for data indexing. Its originality is twofold. First, it takes advantage of variable length DNA codewords to avoid homopolymers longer than $N$ bases when encoding binary data. Second, it relies on a slidi...Show More
Performance analysis of BPSK and QPSK using error correcting code through AWGN
Suzi Seroja Sarnin;Norasimah Kadri;Aiza Mahyuni Mozi;Norfishah Ab Wahab;Nani Fadzlina Naim
2010 International Conference on Networking and Information Technology
Year: 2010 | Conference Paper |
Cited by: Papers (4)
This paper highlight the performance analysis of BPSK and QPSK using error correcting code. To calculate the bit error rate, different types of error correcting code were used through an Additive White Gaussian Noise (AWGN) channel. Bose-Chaudhuri-Hocquenghem (BCH), Cyclic code and hamming code were used as the encoder/decoder technique. Basically, the performance was determined in term of bit rat...Show More
EHTC: An Enhanced Huffman Tree Coding Algorithm and its FPGA Implementation
2018 IEEE 4th International Conference on Computer and Communications (ICCC)
Year: 2018 | Conference Paper |
Cited by: Papers (2)
Many computer systems require storing a large volume of data sets, which are steadily increasing as computer applications are extended to new disciplines. Simultaneously, the proliferation of computer networks is resulting in a massive transfer of data over communication links. Consequently, reduction of transmitted data directly leads to an increased capacity of communication channels. This proje...Show More
Overflow Probability of Variable-Length Codes With Codeword Cost
Lossless variable-length source coding with codeword cost is considered for general sources. The problem setting, where we impose on unequal costs on code symbols, is called the variable-length coding with codeword cost. In this problem, the infimum of average codeword cost have already been determined for general sources. On the other hand, the overflow probability, which is defined as the probab...Show More
Blind Estimation of Polar Encoder Parameters
2023 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)
Year: 2023 | Conference Paper |
Forward error correction (FEC) codes are widely used to correct the errors in the transmitted data and it improves the reliability of the digital transmission. In a practical communication system, accurate information about the channel coding technique is required at the receiver side. However, in certain applications and future generation communication systems, it is mandatory to propose automati...Show More
On the Design of Near-Optimal Variable-Length Error-Correcting Codes for Large Source Alphabets
In this paper, we focus on near-optimal designs for variable-length error-correcting (VLEC) codes, while considering the performance in terms of both the average codeword length (ACL) and the symbol-error rate (SER). The criteria for narrowing the search space and enhancing the SER performance are investigated. An efficient code construction algorithm is then devised based on a random search proce...Show More
Constructing the Code Description Of the Transformant DCT Taking into Account their Structural Features
Natalia Barannik;Vitaliy Tverdokhlib;Eliseev Evgeniy;Kateryna Zakomorna;Nataliya Vorontsova;Vitalii Shmakov
2020 IEEE 2nd International Conference on Advanced Trends in Information Theory (ATIT)
Year: 2020 | Conference Paper |
An approach to the construction of a code description of DCT transformants, taking into account the structural features of their binary representation, is presented. It is shown that the proposed model for constructing the code has the ability to reduce the initial number of bits, and also allows you to form a code description of the transformant by a set of independent code blocks. This makes it ...Show More
Many coding standards, such as JPEG, H.261, H.263, MPEG-1, MPEG-2, use variable length code (VLC) as their entropy coding strategy. However, VLCs have a big drawback when transmitting over a noisy channel. This drawback is an error propagation problem. For this reason, reversible variable length codes (RVLCs) have been used to enhance the error resilient capabilities of VLC. This paper presents a ...Show More
A 0.78 mW Low-Power 4.02 High-Compression Ratio Less than 10−6 BER Error-Tolerant Lossless Image Compression Hardware for Wireless Capsule Endoscopy System
2018 IEEE International Symposium on Circuits and Systems (ISCAS)
Year: 2018 | Conference Paper |
Cited by: Papers (1)
A 0.78mW low power error-tolerant lossless image compressor for a wireless capsule endoscopy system is proposed. In order to achieve high compression ratio of 4.02, this work proposes zero-skipping coding and mode switcher architecture that utilize high image sparsity on endoscopy systems. In addition, a Forward Error Correction (FEC) block is proposed to achieve low Bit-error Rate (BER) under 10−...Show More
Minimal Sets for Capacity-Approaching Variable-Length Constrained Sequence Codes
The use of constrained sequence (CS) codes is important for the robust operation of transmission and data storage systems. While most analysis and development of CS codes have focused on fixed-length codes, recent research has demonstrated the advantages of variable-length CS codes. In our design of capacity-approaching variable-length CS codes, the construction of minimal sets is critical. In thi...Show More
Generalization of fuzzy noiseless source coding with utilities
2015 International Conference on Advances in Computer Engineering and Applications
Year: 2015 | Conference Paper |
In coding theory, we study various properties of codes for application in data compression, cryptography, error correction and network coding. The study of codes is introduced in information theory, electrical engineering, mathematics and computer sciences for the transmission of data through reliable and efficient methods. We have to consider how coding of messages can be done efficiently so that...Show More
A Scheme for Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths: Applications to Reed–Solomon, BCH, and Quadratic Residue Codes
A novel scheme is presented for encoding and iterative soft-decision decoding of cyclic codes of prime lengths. The encoding of a cyclic code of a prime length is performed on a collection of codewords which are mapped through Galois Fourier transform into a codeword in a low-density parity-check code with a binary parity-check matrix for transmission. Using this matrix, binary iterative soft-deci...Show More
The Method to Recognize Linear Block Code Based on the Distribution of Code Weight
2018 10th International Conference on Communication Software and Networks (ICCSN)
Year: 2018 | Conference Paper |
Cited by: Papers (1)
The definition and matrix description of linear cyclic code is introduced in this paper first. Then the distribution of code weight is analyzed. The distance of code weight distribution is defined according to distance of vectors. The theoretic probability of code weight of random sequence is ratiocinated. The method to estimate code weight distribution of actual sequence is established. The code ...Show More
Iterative construction of reversible variable-length codes and variable-length error-correcting codes
IEEE Communications Letters
Cited by: Papers (28)
We propose a generic algorithm for the construction of efficient reversible variable-length codes (RVLCs) and variable-length error-correcting (VLEC) codes, which optimizes the codeword length distribution. The algorithm may be applied to any existing codeword selection mechanism, and it is capable of generating codes of higher efficiency in comparison to the algorithms disseminated in the literat...Show More
Modified symmetrical reversible variable-length code and its theoretical bounds
Reversible variable length codes (RVLCs) have been adopted in emerging video coding standards-H.263+ and MPEG-4-to enhance their error-resilience capabilities (which are important and essential) in error-prone environments. This study proposes an efficient algorithm to construct a symmetrical RVLC from a given Huffman code. In addition, theoretical bounds on the maximum codeword length for fixed-l...Show More
Finite Block-Length Analysis of Large-But-Finite MIMO Systems
Behrooz Makki;Tommy Svensson;Mikael Coldrey;Mohamed-Slim Alouini
This letter studies the performance of point-to-point multiple-input-multiple-output systems in the presence of large but finite numbers of transmit and receive antennas. We use some recent results on the achievable rates of finite-length codes to analyze the system performance in the cases with short packets. The results are presented for different fading models. With codewords of finite length, ...Show More
Flicker Mitigating High Rate RLL Codes for VLC with Low Complexity Encoding and Decoding
2018 IEEE International Symposium on Smart Electronic Systems (iSES) (Formerly iNiS)
Year: 2018 | Conference Paper |
Visible light communications integrated with Internet-of-Things has numerous applications in indoor wireless communications and it requires high data rates and flicker mitigation. Flicker mitigation is an important consideration since light emitting diodes are simultaneously used for illumination and communications. Several run-length limited (RLL) codes have been proposed in the literature for fl...Show More
Permutation (d,k) codes: efficient enumerative coding and phrase length distribution shaping
We introduce a new enumerative encoding method for (d,k) codes. The encoding algorithm, which is based on enumeration of multiset permutations, is conceptually simpler and computationally less expensive than other algorithms proposed thus far. We also describe a new application of enumerative encoding methods for phrase length distribution shaping of run-length-limited (RLL) sequences. We demonstr...Show More
On the Design of Variable-Length Error-Correcting Codes
A joint source-channel coding problem that combines the efficient compression of discrete memoryless sources with their reliable communication over memoryless channels via binary prefix-free variable-length error-correcting codes (VLECs) is considered. Under a fixed free distance constraint, a priority-first search algorithm is devised for finding an optimal VLEC with minimal average codeword leng...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.