NDLI: On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications

Please wait, while we are loading the content...

2015 IEEE Information Theory Workshop (ITW)

2014 IEEE Information Theory Workshop (ITW 2014)

2013 IEEE Information Theory Workshop (ITW)

2012 IEEE Information Theory Workshop

2010 IEEE Information Theory Workshop

2009 IEEE Information Theory Workshop

2008 IEEE Information Theory Workshop

2007 IEEE Information Theory Workshop

2007 IEEE Information Theory Workshop

Table of contents

On the pseudocodeword weight and parity-check matrix redundancy of linear codes

The Maximum A Posteriori Decoding Using Variational Bayes Methods for Digital Magnetic Recording Channels

Design of Nonbinary Quasi-Cyclic LDPC Cycle Codes

A Unified Decoding Algorithm for Linear Codes Based on Partitioned Parity-Check Matrices

EXIT Functions for Randomly Punctured Systematic Codes

On the binary self-dual doubly-even codes of length 112

Spectral Shaping Technique for Permutation Distance-Preserving Mapping Codes

Split-Turbo Codes for Nonuniform Sequences

Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels

Probabilistic Capacity and Optimal Coding for Asynchronous Channel

The Effect of Finite Memory on Throughput of Wireline Packet Networks

Iterative Coded Pulse-Position-Modulation for Deep-Space Optical Communications

On the ergodic sum-rate performance of CDD in multi-user systems

Lattice coding for the vector fading paper problem

Information theoretic bounds to sensing capacity of sensor networks under fixed SNR

Average Throughput with Linear Network Coding over the Binary Field

Deterministic Secure Error-Correcting (SEC) Network Codes

Concatenated Random Parity Forwarding in Multi-source Multi-hop Wireless Networks

PHY-layer network coding for broadcast channel with side information

Capacity of Erasure Networks in the Presence of Spatial Network Coding

On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks

Fault Tolerant Memories Based on Expander Graphs

Erasure-Burst and Error-Burst Decoding of Linear Codes

Soft-Input, Iterative, Reed-Solomon Decoding using Redundant Parity-Check Equations

The Complexity Limits of Graphical Models for Linear Codes

On the Complexity of Exact Maximum-Likelihood Decoding for Asymptotically Good Low Density Parity Check Codes: A New Perspective

Adding a Rate-1 Third Dimension to Turbo Codes

A Random Interleaver Based Successive Decoding Scheme over Markov Channels

On Codes of Bounded Trellis Complexity

Analysis of Iterated Hard Decision Decoding of Product Codes with Reed-Solomon Component Codes

Performance of LDPC Codes Under Noisy Message-Passing Decoding

On the error exponent of Markov channels with ISI and feedback

Degree Optimization and Stability Condition for the Min-Sum Decoder

Bounds on the Tradeoff Between Decoding Complexity and Rate for Sparse-Graph Codes

Evaluation of the Low Frame Error Rate Performance of LDPC Codes Using Importance Sampling

Improving LDPC Decoders via Informed Dynamic Scheduling

Analysis of the Distribution of the Number of Correctable Erasures for Turbo Codes with DRP Interleavers

On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications

Approximate message-passing inference algorithm

Reducing the Error Floor

Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs

On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes

Performance of Iterative Algebraic Decoding of Codes Defined on Graphs: An Initial Investigation

The Case for Structured Random Codes in Network Communication Theorems

On Separation in the Presence of Feedback

Resource-Aware Joint Source-Channel Multiple Description Estimation and Compression in Networks

Joint Source-Channel Coding for Quasi-Static Fading Channels with Noisy Quantized Feedback

On Real-Time Communication Systems with Noisy Feedback

Optimality of Dimension Expanding Shannon-Kotel'nikov Mappings

Image Encryption and Data Hiding: Duality and Code Designs

On the Duality and Difference Between Slepian-Wolf Coding and Channel Coding

On Network Interference Management

Capacity for Classes of Broadcast Channels with Receiver Side Information

Successive Refinement of Vector Sources under Individual Distortion Criteria

On Cognitive Interference Networks

Unicast Transmission Over Multiple Access Erasure Networks: Capacity and Duality

Secure Nested Codes for Type II Wiretap Channels

Reliable Communication in Networks with Multi-access Interference

The Constrained Capacity of Single and Multiuser Channels with Unknown Fading

Asynchrony Resilient Space-Time Block Codes

New List Sphere Decoding (LSD) Algorithms for MIMO Detection with LDPC FEC

A Generalized Mixed Strategy for Multiterminal Relay Networks

A New Coding Scheme for the Relay Channel

Rateless coding with partial CSI at the decoder

On the Capacity of a Class of MIMO Cognitive Radios

Optimal Transmission Strategy and Capacity Region for Broadcast Z Channels

An Information Theoretic Approach to Quantifying Evolutionary Functional Trends

Geometric Local Structure in Biological Networks

On Optimal Information Storage in Synapses

Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs

Learning From Compressed Observations

Network Distributed Quantization

On Approximating the Rate Region for Source Coding with Coded Side Information

Practical Coding for Multi-Hop Networks

On Secure Distributed Source Coding

Challenges and Recent Advances in Distributed Predictive Coding

Minimum Expected Distortion in Gaussian Source Coding with Uncertain Side Information

Achievable Region for Multiterminal Source Coding with Lossless Decoding in All Sources Except One

Diophantine Index Assignments for Distributed Source Coding

Decentralized Algorithms for Operating Coded Wireless Networks

Intermediate Performance of Rateless Codes

Linear Space-Time Codes with Optimal Diversity-Multiplexing Tradeoff

The Diversity-Multiplexing Tradeoff of Linear MIMO Receivers

Tradeoff Between Diversity and Decodable-Rate: Diversity Multiplexing Tradeoff for Fixed Encoding Schemes

Joint Channel Estimation and Data Transmission: Achievable Rates

Transmitter channel state information and repetition protocols in block fading channels

Distributed Estimation; Three Theorems

Efficient Coding of Labelled Graphs

On a Conjecture on Error Recovery for Variable Length Codes

Universal Fixed-Length Coding Redundancy

Nonlinear Sparse-Graph Codes for Lossy Compression of Discrete Nonredundant Sources

Joint Multiple Description Coding and FEC for Delay-Constrained Applications in Congested Networks

Fast Joint Source-Channel Decoding of Convolutional Coded Markov Sequences with Monge Property

Distortion Metrics of Composite Channels with Receiver Side Information

Asynchronous Logic Implementation of Tree-Structured SISOs

LDPC Decoder Message Formatting Based on Activity Factor Minimization Using Differential Density Evolution

Functions and Architectures for LDPC Decoding

Low-Complexity Capacity Achieving Two-Stage Demodulation/Decoding for Random Matrix Channels

Fast Decoding of the Golden Code by Diophantine Approximation

Secure Communication with a Relay Helping the Wire-tapper

Deterministic Capacity of Networks

A Deterministic Model for Wireless Channels and its Aplications

Multiple Access Channels with Generalized Feedback and Confidential Messages

Signal Superposition Coded Cooperative Diversity: Analysis and Optimization

On the Outage Exponent of Fading Relay Channels with Partial Channel State Information

Coding for the Non-Orthogonal Amplify-and-Forward Cooperative Channel

On the Continuity of Achievable Rate Regions for Source Coding over Networks

New tricks for old dogs: Large alphabet probability estimation

Entropy Estimators with Almost Sure Convergence and an O(n-1) Variance

Lower bounds on the rate-distortion function of LDGM codes

Random Access Region of Interest in Backward Coding of Wavelet Trees

Achieving the Rate-Distortion Bound with Linear Codes

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005.

On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications

Content Provider	IEEE Xplore Digital Library
Author	Cheng Huang Jin Li Minghua Chen
Copyright Year	2007
Description	Author affiliation: Microsoft Res., Redmond (Cheng Huang; Jin Li; Minghua Chen)
Abstract	For fault-tolerant storage applications, computation complexity is the key concern in choosing XOR-based codes. We observe that there is great benefit in computing common operations first (COF). Based on the COF rule, we describe a generic problem of optimizing XOR-based codes and make a conjecture about its NP-completeness. Two effective greedy algorithms are proposed. Against long odds, we show that XOR-based Reed-Solomon codes with such optimization can in fact be as efficient and sometimes even more efficient than the best known specifically designed XOR-based codes.
Starting Page	218
Ending Page	223
File Size	292538
Page Count	6
File Format	PDF
ISBN	1424415632
DOI	10.1109/ITW.2007.4313077
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-09-02
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Reed-Solomon codes Greedy algorithms Fault tolerance Redundancy Computer applications Lakes Encoding Decoding Application software Design optimization
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in