Sciweavers

2621 search results - page 39 / 525
» Near orders and codes
Sort
View
DAM
2006
69views more  DAM 2006»
13 years 8 months ago
On the binary projective codes with dimension 6
All binary projective codes of dimension up to 6 are classified. Information about the number of the codes with different minimum distances and different orders of automorphism gro...
Iliya Bouyukliev
TIT
2010
90views Education» more  TIT 2010»
13 years 3 months ago
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two capacityachieving code ensembles with different algebraic structure. It is proved t...
Giacomo Como
ICSE
2009
IEEE-ACM
14 years 9 months ago
Equality and hashing for (almost) free: Generating implementations from abstraction functions
ng Implementations from Abstraction Functions Derek Rayside, Zev Benjamin, Rishabh Singh, Joseph P. Near, Aleksandar Milicevic and Daniel Jackson Computer Science and Artificial In...
Derek Rayside, Zev Benjamin, Rishabh Singh, Joseph...
TIT
2010
144views Education» more  TIT 2010»
13 years 3 months ago
Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the b...
Enrico Paolini, Marc P. C. Fossorier, Marco Chiani
ICIP
2009
IEEE
14 years 9 months ago
Parallel Rate-distortion Optimized Intra Mode Decision On Multi-core Graphics Processors Using Greedy-based Encoding Orders
Rate-distortion (RD) optimized intra-prediction mode selection can lead to significant improvement in coding efficiency in intraframe encoding. However, it would incur considerabl...