Sciweavers

2081 search results - page 51 / 417
» codes 2006
Sort
View
CORR
2006
Springer
97views Education» more  CORR 2006»
14 years 12 months ago
Improved Nearly-MDS Expander Codes
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
Ron M. Roth, Vitaly Skachek
RTS
2010
121views more  RTS 2010»
14 years 10 months ago
A compiler framework for the reduction of worst-case execution times
The current practice to design software for real-time systems is tedious. There is almost no tool support that assists the designer in automatically deriving safe bounds of the wor...
Heiko Falk, Paul Lokuciejewski
ASAP
2006
IEEE
138views Hardware» more  ASAP 2006»
15 years 3 months ago
Configurable, High Throughput, Irregular LDPC Decoder Architecture: Tradeoff Analysis and Implementation
Low Density Parity Check (LDPC) codes are one of the best error correcting codes that enable the future generations of wireless devices to achieve higher data rates. This paper pr...
Marjan Karkooti, Predrag Radosavljevic, Joseph R. ...
JSYML
2002
70views more  JSYML 2002»
14 years 11 months ago
Coding with Ladders A Well Ordering of The Reals
Any model of ZFC + GCH has a generic extension (made with a poset of size 2) in which the following hold: MA + 20 = 2+ there exists a 2 1-well ordering of the reals. The proof con...
Uri Abraham, Saharon Shelah
COMBINATORICS
2006
87views more  COMBINATORICS 2006»
14 years 12 months ago
Optimal Four-Dimensional Codes over GF(8)
We prove the nonexistence of several four-dimensional codes over GF(8) that meet the Griesmer bound. The proofs use geometric methods based on the analysis of the weight structure...
Chris Jones, Angela Matney, Harold N. Ward