Sciweavers

119 search results - page 15 / 24
» Bounds on Codes Based on Graph Theory
Sort
View
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 7 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
EM
2010
155views Management» more  EM 2010»
13 years 7 months ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...
ASIACRYPT
2004
Springer
14 years 15 days ago
Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
INFOCOM
2009
IEEE
14 years 1 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
FASE
2007
Springer
14 years 1 months ago
Information Preserving Bidirectional Model Transformations
Abstract. Within model-driven software development, model transformation has become a key activity. It refers to a variety of operations modifying a model for various purposes such...
Hartmut Ehrig, Karsten Ehrig, Claudia Ermel, Frank...