Sciweavers

    11 search results - page 1 / 3
    » Bounds on the Capacity of Channels with Insertions, Deletion...
    Sort
    View
    TCOM
    2011
    74views more  TCOM 2011»
    Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions
    14 years 7 months ago
    Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions
    Download  www.itsoc.org
    Dario Fertonani, Tolga M. Duman, M. Fatih Erden
    claim paper
    Read More »
    104
    Voted
    ADT
    2005
    85views Programming Languages» more  ADT 2005»
    Marker codes for channels with insertions and deletions
    15 years 14 days ago
    Marker codes for channels with insertions and deletions
    Download  www.inference.phy.cam.ac.uk
    Coding for channels with synchronization errors is studied. Marker codes, each consisting of a low-density parity-check code with inserted markers, are developed. At low insertion...
    Edward A. Ratzer
    claim paper
    Read More »
    150
    Voted
    MEDIAFORENSICS
    2010
    161views Forensic Engineering» more  MEDIAFORENSICS 2010»
    On the embedding capacity of DNA strands under substitution, insertion, and deletion mutations
    14 years 11 months ago
    On the embedding capacity of DNA strands under substitution, insertion, and deletion mutations
    Download  www.csi.ucd.ie
    A number of methods have been proposed over the last decade for embedding information within deoxyribonucleic acid (DNA). Since a DNA sequence is conceptually equivalent to a unid...
    Félix Balado
    claim paper
    Read More »
    100
    Voted
    TIFS
    2008
    102views more  TIFS 2008»
    Insertion, Deletion Codes With Feature-Based Embedding: A New Paradigm for Watermark Synchronization With Applications to Speech
    15 years 13 days ago
    Insertion, Deletion Codes With Feature-Based Embedding: A New Paradigm for Watermark Synchronization With Applications to Speech
    Download  www.ece.rochester.edu
    A framework is proposed for synchronization in feature-based data embedding systems that is tolerant of errors in estimated features. The method combines feature-based embedding wi...
    David J. Coumou, Gaurav Sharma
    claim paper
    Read More »
    65
    Voted
    TIT
    2008
    84views more  TIT 2008»
    Capacity Bounds for Sticky Channels
    15 years 13 days ago
    Capacity Bounds for Sticky Channels
    Download  www.eecs.harvard.edu
    The capacity of sticky channels, a subclass of insertion channels where each symbol may be duplicated multiple times, is considered. The primary result is to provide nearly tight n...
    Michael Mitzenmacher
    claim paper
    Read More »
    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-2025, USA.