Results 31 to 40 of about 1,678,536 (296)
Algorithms for Majority Decoding of Group Codes
Моделирование и анализ информационных систем, 2015 We consider a problem of constructive description and justification of the algorithms necessary for a practical implementation of the majority decoder for group codes specified as left ideals of groupalgebras.
V. M. Deundyak, Y. V. Kosolapov
doaj +1 more source
IEEE Access, 2020 The main challenge for hardware implementation of non-binary LDPC decoding is the high computational complexity and large memory requirement. To address this challenge, five new low complexity LDPC decoding algorithms are proposed in this paper.
Waheed Ullah +2 more
doaj +1 more source
Variable-Node-Based Belief-Propagation Decoding With Message Pre-Processing for NAND Flash Memory
IEEE Access, 2019 With the fast development of non-volatile storage technology, NAND flash memory faces more and more challenges such as data reliability and lifetime. To overcome the issue of the reliability, low-density parity-check (LDPC) codes are considered as a main
Xingcheng Liu, Guojun Yang, Xuechen Chen
doaj +1 more source
Fast Decoding of Images With Cryptcodes for Burst Channels
IEEE Access, 2023 The concept of cryptcoding arises from the need to obtain secure and accurate transmission. This has led to an intensive development of coding theory and cryptography as scientific fields dealing with these problems.
Aleksandra Popovska-Mitrovikj +2 more
doaj +1 more source
Reduced-complexity syndrome-based TTCM decoding [PDF]
, 2013 The iterative decoder of Turbo Trellis Coded Modulation (TTCM) exchanges extrinsic information between the constituent TCM decoders, which imposes a high computational complexity at the receiver. Therefore we conceive the syndrome-based block decoding of
Ng, Soon Xin +2 more
core +1 more source
List-Decoding Algorithms for Lifted Codes [PDF]
IEEE Transactions on Information Theory, 2016 15 pages, no figures.
Alan Guo, Swastik Kopparty
openaire +3 more sources
A minimax robust decoding algorithm
IEEE Transactions on Information Theory, 2000 We study the decoding problem in an uncertain noise environment. If the receiver knows the noise probability density function (PDF) at each time slot or its a priori probability, the standard Viterbi (1967) algorithm (VA) or the a posteriori probability (APP) algorithm can achieve optimal performance.
Wei, Lei +3 more
openaire +4 more sources
Algorithmic Results in List Decoding [PDF]
Foundations and Trends® in Theoretical Computer Science, 2007 Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redundancy into the data to produce an associated codeword. The redundancy built into the codewords enables one to decode the original data even from a somewhat distorted version of ...
openaire +1 more source
A decoding algorithm for twisted Gabidulin codes [PDF]
2017 IEEE International Symposium on Information Theory (ISIT), 2017 This paper was submitted to ISIT ...
Joachim Rosenthal +1 more
openaire +4 more sources
Precoded Sphere Packing Aided Bit-Interleaved Differential Spa ce-Time Coded Modulation Using Iterative Decoding [PDF]
, 2008 —In this treatise, we investigate a precoded and sphere packing (SP)-aided bit-interleaved differential space-time coded modulation scheme using iterative decoding. The amalgamated design and interworking of the SP, differential encoding, and iteratively
Alamri, Osamah +3 more
core +1 more source