6 search results - page 1 / 2 » (6, 3)-MDS Codes over an Alphabet of Size 4 |
50
Voted
DCC
2006
IEEE
16 years 3 days ago
2006
IEEE
Abstract. An (n, k)q-MDS code C over an alphabet A (of size q) is a collection of qk n-tuples over A such that no two words of C agree in as many as
124
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
89
Voted
SIAMDM
2008
15 years 13 days ago
2008
Let C be a code of length n over an alphabet of size q. A word d is a descendant of a pair of codewords x, y C if di {xi, yi} for 1 i n. A code C is an identifiable parent prop...
91
Voted
CORR
2008
Springer
15 years 18 days ago
2008
Springer
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...
116
click to vote
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...