Sciweavers

35 search results - page 5 / 7
» Linear Codes over Finite Chain Rings
Sort
View
DM
2008
112views more  DM 2008»
13 years 7 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
AICT
2009
IEEE
132views Communications» more  AICT 2009»
14 years 18 days ago
Chaotic Digital Encoding for 2D Trellis-Coded Modulation
—In this paper, nonlinear digital filters with finite precision are analyzed as recursive systematic convolutional (RSC) encoders. An infinite impulse response (IIR) digital filt...
Calin Vladeanu, Safwan El Assad, Jean-Claude Carla...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Distributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
Dinesh Krithivasan, S. Sandeep Pradhan
ASPLOS
2009
ACM
14 years 8 months ago
3D finite difference computation on GPUs using CUDA
In this paper we describe a GPU parallelization of the 3D finite difference computation using CUDA. Data access redundancy is used as the metric to determine the optimal implement...
Paulius Micikevicius
DGCI
2009
Springer
13 years 10 months ago
A Linear Time and Space Algorithm for Detecting Path Intersection
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
Srecko Brlek, Michel Koskas, Xavier Provenç...