Sciweavers

    TIT
    2008
    84views more  TIT 2008»
    Information Theoretic Bounds on Authentication Systems in Query Model
    13 years 4 months ago
    Information Theoretic Bounds on Authentication Systems in Query Model
    Download  eprint.iacr.org
    Authentication codes provide message integrity guarantees in an information theoretic sense within a symmetric key setting. Information theoretic bounds on the success probability...
    Reihaneh Safavi-Naini, Peter R. Wild
    claim paper
    Read More »
    TIT
    2008
    117views more  TIT 2008»
    Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks
    13 years 4 months ago
    Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks
    Download  www.stanford.edu
    In wireless networks, throughput optimization is an essential performance objective that cannot be adequately characterized by a single criterion (such as the minimum transmitted o...
    Yalin Evren Sagduyu, Anthony Ephremides
    claim paper
    Read More »
    TIT
    2008
    58views more  TIT 2008»
    On Information Embedding When Watermarks and Covertexts are Correlated
    13 years 4 months ago
    On Information Embedding When Watermarks and Covertexts are Correlated
    Download  www.multicom.uwaterloo.ca
    En-Hui Yang, Wei Sun
    claim paper
    Read More »
    TIT
    2008
    82views more  TIT 2008»
    Error Control Codes for Parallel Asymmetric Channels
    13 years 4 months ago
    Error Control Codes for Parallel Asymmetric Channels
    Download  www.math.uni-bielefeld.de
    We introduce and study error correcting codes for parallel synchronous communication via asymmetric channels. Constructions for error detecting/correcting codes are presented. Mor...
    Rudolf Ahlswede, Harout K. Aydinian
    claim paper
    Read More »
    TIT
    2008
    65views more  TIT 2008»
    Power-Efficient Resource Allocation for Time-Division Multiple Access Over Fading Channels
    13 years 4 months ago
    Power-Efficient Resource Allocation for Time-Division Multiple Access Over Fading Channels
    Download  www.ee.fau.edu
    We investigate resource allocation policies for time-division multiple access (TDMA) over fading channels in the power-limited regime. For frequency-flat block-fading channels and ...
    Xin Wang, Georgios B. Giannakis
    claim paper
    Read More »
    TIT
    2008
    81views more  TIT 2008»
    Codes Defined by Forms of Degree 2 on Quadric Surfaces
    13 years 4 months ago
    Codes Defined by Forms of Degree 2 on Quadric Surfaces
    Download  iml.univ-mrs.fr
    We study the functional codes C2(X) defined on projective varieties X, in the case where X P3 is a 1-degenerate quadric or a non-degenerate quadric (hyperbolic or elliptic). We fi...
    Frédéric A. B. Edoukou
    claim paper
    Read More »
    TIT
    2008
    100views more  TIT 2008»
    Communication Via Decentralized Processing
    13 years 4 months ago
    Communication Via Decentralized Processing
    Download  ee.usc.edu
    Abstract-- The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. acc...
    Amichai Sanderovich, Shlomo Shamai, Yossef Steinbe...
    claim paper
    Read More »
    TIT
    2008
    147views more  TIT 2008»
    On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
    13 years 4 months ago
    On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
    Download  vneumann.etse.urv.es
    Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
    Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
    claim paper
    Read More »
    TIT
    2008
    103views more  TIT 2008»
    Fast Distributed Algorithms for Computing Separable Functions
    13 years 4 months ago
    Fast Distributed Algorithms for Computing Separable Functions
    Download  cs.stanford.edu
    The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
    Damon Mosk-Aoyama, Devavrat Shah
    claim paper
    Read More »
    TIT
    2008
    68views more  TIT 2008»
    On the Hardness of Decoding the Gale-Berlekamp Code
    13 years 4 months ago
    On the Hardness of Decoding the Gale-Berlekamp Code
    Download  www.cs.technion.ac.il
    The Gale
    Ron M. Roth, Krishnamurthy Viswanathan
    claim paper
    Read More »
    « first‹ previous…456789101112…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.