Sciweavers

5056 search results - page 95 / 1012
» Network Coding Theory
Sort
View
DCC
2008
IEEE
14 years 10 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen
DAGSTUHL
2006
14 years 1 days ago
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence fo
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
Boris Ryabko, Jaakko Astola, Alexander Gammerman
DCC
2006
IEEE
14 years 10 months ago
Evaluation codes and plane valuations
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
C. Galindo, M. Sanchis
CPHYSICS
2008
161views more  CPHYSICS 2008»
13 years 10 months ago
Implementing peridynamics within a molecular dynamics code
Peridynamics (PD) is a continuum theory that employs a nonlocal model to describe material properties. In this context, nonlocal means that continuum points separated by a finite ...
Michael L. Parks, Richard B. Lehoucq, Steven J. Pl...
IMA
2009
Springer
132views Cryptology» more  IMA 2009»
14 years 5 months ago
Subspace Codes
Abstract. This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adver...
Azadeh Khaleghi, Danilo Silva, Frank R. Kschischan...