Results 21 to 30 of about 40,762 (259)
Performance Study of a Class of Irregular Near Capacity Achieving LDPC Codes
Journal of Communications Software and Systems, 2021 This paper investigates the performance of a class of irregular low-density parity-check (LDPC) codes through a recently published low complexity upper bound on their beliefpropagation decoding thresholds.
Francesca Vatta +4 more
doaj +1 more source
Endomorphisms of Linear Block Codes
2024 IEEE International Symposium on Information Theory (ISIT)Accepted for presentation at International Symposium on Information Theory 2024; Included reviews: Changed some wordings, Indicate that 32,16 Polar code is a RM code; Smaller formatting changes, Results unchanged,
Mandelbaum, Jonathan +3 more
openaire +3 more sources
GEOMETRIC CONSTRUCTION CODES OF HAMMING DISTANCE-8
Electrica, 2008 A new high rate binary linear block code construction technique, named as Geometric Construction (GC) codes, was proposed recently [1]. It generates all the even full information rate (optimal) Hamming distance – 4 codes.
Gökmen Altay
doaj +2 more sources
On Guaranteed Correction of Error Patterns with Artificial Neural Networks
Telfor Journal, 2022 In this paper, we analyze applicability of single- and two-hidden-layer feed-forward artificial neural networks, SLFNs and TLFNs, respectively, in decoding linear block codes.
S. Brkić, P. Ivaniš, B. Vasić
doaj +1 more source
RNN Decoding of Linear Block Codes
CoRR, 2017 Designing a practical, low complexity, close to optimal, channel decoder for powerful algebraic codes with short to moderate block length is an open research problem. Recently it has been shown that a feed-forward neural network architecture can improve on standard belief propagation decoding, despite the large example space. In this paper we introduce
Eliya Nachmani +3 more
openaire +2 more sources
Trellis decoding complexity of linear block codes [PDF]
IEEE Transactions on Information Theory, 1996 Summary: In this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers.
Kiely, Aaron B. +4 more
openaire +3 more sources
Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms
Journal of Electrical and Computer Engineering, 2012 A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new
Ahmed Azouaoui +2 more
doaj +1 more source
Advances in Electrical and Electronic Engineering, 2013 The paper deals with the problem of determination of error probability of cryptography and safety codes used within the safety-related railway applications with increasing safety integrity level (SIL).
Maria Franekova +2 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Acute lymphoblastic leukaemia (ALL) is one of the most treatable forms of paediatric cancer; however, there is a substantial burden of treatment‐related toxicities (TRTs). In addition, the long‐term changes in children's health‐related quality of life (HRQoL) due to toxic treatments are not well understood.
Clare Ghows +19 more
wiley +1 more source
STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM [PDF]
ICTACT Journal on Communication Technology, 2012 The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some convolutional codes.
H. Prashantha Kumar +3 more
doaj