Sciweavers

5056 search results - page 217 / 1012
» Network Coding Theory
Sort
View
160
Voted
TIT
2008
122views more  TIT 2008»
15 years 7 months ago
Identifying Codes and Covering Problems
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
Moshe Laifenfeld, Ari Trachtenberg
204
Voted
ICCS
2007
Springer
15 years 11 months ago
Belief Flow in Assertion Networks
We define an abstract model of belief propagation on a graph based on the methodology of the revision theory of truth together with the Assertion Network Toolkit, a graphical inter...
Sujata Ghosh, Benedikt Löwe, Erik Scorelle
174
Voted
DCC
2005
IEEE
16 years 6 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
216
Voted
IUI
2005
ACM
16 years 18 days ago
Metafor: visualizing stories as code
Every program tells a story. Programming, then, is the art of constructing a story about the objects in the program and what they do in various situations. So-called programming l...
Hugo Liu, Henry Lieberman
215
Voted
FOCS
2002
IEEE
15 years 12 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich