Results 291 to 300 of about 5,975,260 (378)
Some of the next articles are maybe not open access.
IEEE Transactions on Communications, 1996
The A* algorithm is applied to maximum-likelihood soft-decision decoding of binary linear block codes. This paper gives a tutorial on the A* algorithm, compares the decoding complexity with that of exhaustive search and Viterbi decoding algorithms, and presents performance curves obtained for several codes.
S.J. Dolinar, L. Ekroot
openaire +2 more sources
The A* algorithm is applied to maximum-likelihood soft-decision decoding of binary linear block codes. This paper gives a tutorial on the A* algorithm, compares the decoding complexity with that of exhaustive search and Viterbi decoding algorithms, and presents performance curves obtained for several codes.
S.J. Dolinar, L. Ekroot
openaire +2 more sources
LLM-based and Retrieval-Augmented Control Code Generation
2024 IEEE/ACM International Workshop on Large Language Models for Code (LLM4Code)Control code is designed and implemented for industrial automation applications that manage power plants, petrochemical processes, or steel production.
Heiko Koziolek +5 more
semanticscholar +1 more source
2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE), 2010
This paper, studies the comparative performance of a traditional and Concatenated coding schemes for transmission of digital data over a mobile communication channel. Traditional codes are effective for reliable transmission of information over hostile channel when the errors caused by the channel are statistically independent.
Yousef Hwegi, Mahmod Osman, Nasser Ali
openaire +2 more sources
This paper, studies the comparative performance of a traditional and Concatenated coding schemes for transmission of digital data over a mobile communication channel. Traditional codes are effective for reliable transmission of information over hostile channel when the errors caused by the channel are statistically independent.
Yousef Hwegi, Mahmod Osman, Nasser Ali
openaire +2 more sources
Information Processing Letters, 2021
A binary Write Once Memory (WOM) device is a storage mechanism in which a 0-bit can be overwritten much more easily than a 1-bit. A famous example is the flash memory technology, where 0→1 transitions are allowed, but 1 → 0 transitions require a costly erase procedure and are therefore prohibited.
Gilad Baruch +2 more
openaire +2 more sources
A binary Write Once Memory (WOM) device is a storage mechanism in which a 0-bit can be overwritten much more easily than a 1-bit. A famous example is the flash memory technology, where 0→1 transitions are allowed, but 1 → 0 transitions require a costly erase procedure and are therefore prohibited.
Gilad Baruch +2 more
openaire +2 more sources
IEEE Transactions on Information Theory, 2009
A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander ...
Dmitri Truhachev +3 more
openaire +1 more source
A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander ...
Dmitri Truhachev +3 more
openaire +1 more source
Power-Balanced Orthogonal Space–Time Block Code
IEEE Transactions on Vehicular Technology, 2008In this paper, we propose two new systematic ways to construct amicable orthogonal designs (AODs), with the aim of facilitating the construction of power-balanced orthogonal space-time block codes (O-STBCs) with favorable practical attributes.
C. Yuen, Y. Guan, T. Tjhung
semanticscholar +1 more source
2020
We’re about to go over some universal rules of code syntax to learn the structure of code files and to understand some fundamental terms and concepts.
openaire +2 more sources
We’re about to go over some universal rules of code syntax to learn the structure of code files and to understand some fundamental terms and concepts.
openaire +2 more sources
IEEE Potentials, 2001
The article discusses systematic cyclic linear block codes. A block code uses an encoder that accepts a block of message symbols, and generates a block of code word symbols at the output. This type is in contrast to a convolutional code when the encoder accepts a continuous stream of symbols and similarly generates a continuous encoded output stream. A
K. Ramaswamy, L. Litwin
openaire +2 more sources
The article discusses systematic cyclic linear block codes. A block code uses an encoder that accepts a block of message symbols, and generates a block of code word symbols at the output. This type is in contrast to a convolutional code when the encoder accepts a continuous stream of symbols and similarly generates a continuous encoded output stream. A
K. Ramaswamy, L. Litwin
openaire +2 more sources
On the rectangularity of nonlinear block codes
IEEE Transactions on Information Theory, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sidorenko, V. +2 more
openaire +3 more sources
Woven codes with outer block codes [PDF]
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2002 Woven codes with outer binary block codes and additional permutation are presented. This enables the construction of a new class of woven block codes, where the minimum distance is about twice the product of the minimum distances of the component codes.
Sergo Shavgulidze +3 more
openaire +1 more source