Sciweavers

3373 search results - page 98 / 675
» Linear transformations on codes
Sort
View
DCC
2006
IEEE
16 years 2 months ago
Codes with a Certain Weight-preserving Transitive Group of Automorphisms
We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nont...
Michael Giudici
SIGSOFT
2007
ACM
16 years 4 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
AAECC
2007
Springer
118views Algorithms» more  AAECC 2007»
15 years 9 months ago
The "Art of Trellis Decoding" Is NP-Hard
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C′ whose minimal trellis has the least state-compl...
Navin Kashyap
CORR
2006
Springer
151views Education» more  CORR 2006»
15 years 3 months ago
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
Igal Sason, Idan Goldenberg
CJ
2004
110views more  CJ 2004»
15 years 3 months ago
Efficient Parallel Algorithms for Euclidean Distance Transform
A parallel algorithm for Euclidean Distance Transform (EDT) on linear array with reconfigurable pipeline bus system (LARPBS) is presented. For an image with n
Ling Chen, Yi Pan, Yixin Chen, Xiao-hua Xu