FAQ

Redundancy (information theory)

Known as: Redundancy 
In Information theory, redundancy measures the fractional difference between the entropy H(X) of an ensemble X, and its maximum possible value… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2018
02040608019732018

Related topics

Related topics

49 relations
A Mathematical Theory of CommunicationAlloproteinAutomatic link establishmentBitVault
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Redundancy (information theory)
Stationary process
Zero suppression
Stochastic process
Data compression
XML

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Error Free Coding
An adap~ive ~ransform coding technique followed bya OPCM technique is employed ~o code mul~ispectral data. A method of ins… (More)
Is this relevant?
2008
2008
Throughput-Delay Performance of Half-Duplex Hybrid-ARQ Relay Channels
The throughput-delay performance of a half-duplex relay channel with hybrid-automatic retransmission request (HARQ) is analyzed… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Locality-Based Information Redundancy for Processor Reliability
In this work, we propose a novel information redundancy scheme to protect microprocessors from transient faults. Similar to… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Incremental redundancy hybrid ARQ schemes based on low-density parity-check codes
We study the throughput of hybrid automatic retransmission request (H-ARQ) schemes based on incremental redundancy (IR) over a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
An Analysis of Case-Base Editing in a Spam Filtering System
Because of the volume of spam email and its evolving nature, any deployed Machine Learning-based spam filtering system will need… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
32-Bit Cyclic Redundancy Codes for Internet Applications
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A Framework for Real-time Path Planning in Changing Environments
We present a new method for generating collision-free paths for robots operating in changing environments. Our approach is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Performance comparison of HARQ with Chase combining and incremental redundancy for HSDPA
In this paper we compare two hybrid automatic repeat request (HARQ) combining strategies that currently are considered for the… (More)
  • table I
  • table I
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
1997
1997
Arithmetic coding-based continuous error detection for efficient ARQ-based image transmission
Block cyclic redundancy check (CRC) codes are typically used to perform error detection in automatic repeat request (ARQ… (More)
  • figure 1
  • figure 2
Is this relevant?
1989
1989
Sensor array signal processing via a procrustes rotations based eigenanalysis of the ESPRIT data pencil
We here propose the Procrustes Rotations based ESPRIT algorithm, PRO-ESPRIT, for estimating characteristic parameters associated… (More)
  • figure I
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?