Sciweavers

498 search results - page 10 / 100
» New Constructions for IPP Codes
Sort
View
CATS
2006
13 years 8 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev
AAECC
2004
Springer
100views Algorithms» more  AAECC 2004»
13 years 7 months ago
Convolutional Codes of Goppa Type
A new kind of Convolutional Codes generalizing Goppa Codes is proposed. This provides a systematic method for constructing convolutional codes with prefixed properties. In particul...
J. A. Domínguez Pérez, J. M. Mu&ntil...
JSAC
2010
132views more  JSAC 2010»
13 years 1 months ago
Very Efficient Balanced Codes
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated...
K. Schouhamer Immink, J. Weber
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Power-Balanced Orthogonal Space-Time Block Code
In this paper, we propose two new systematic ways to construct amicable orthogonal designs (AOD), with an aim to facilitate the construction of power-balanced orthogonal spacetime ...
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
IPPS
2003
IEEE
14 years 12 days ago
Extending OpenMP to Support Slipstream Execution Mode
OpenMP has emerged as a widely accepted standard for writing shared memory programs. Hardware-specific extensions such as data placement are usually needed to improve the scalabi...
Khaled Z. Ibrahim, Gregory T. Byrd