Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,534,398 papers from all fields of science
Search
Sign In
Create Free Account
Singleton bound
Known as:
Singleton
, MDS code
, MDS
Expand
In coding theory, the Singleton bound, named after Richard Collom Singleton, is a relatively crude upper bound on the size of an arbitrary block code…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Block code
Coding theory
Concatenated error correction code
Cyclic code
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Location-Based Crowdsourcing for Vehicular Communication in Hybrid Networks
Di Wu
,
Yuan Zhang
,
L. Bao
,
A. Regan
IEEE transactions on intelligent transportation…
2013
Corpus ID: 14195375
It is a challenge to design efficient routing protocols for vehicular ad hoc networks (VANETs) because of their highly dynamic…
Expand
2013
2013
Constructions of fractional repetition codes from combinatorial designs
Oktay Ölmez
,
A. Ramamoorthy
Asilomar Conference on Signals, Systems and…
2013
Corpus ID: 18137010
We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point…
Expand
2013
2013
Replication based storage systems with local repair
Oktay Ölmez
,
A. Ramamoorthy
International Symposium on Network Coding
2013
Corpus ID: 5914989
We consider the design of regenerating codes for distributed storage systems that enjoy the property of local, exact and uncoded…
Expand
2009
2009
Effect of an MDS code on the outage probability in cooperative multi-hop relaying networks
K. Sakakibara
,
Daichi Itoh
,
Jumpei Taketsugu
IEEE 9th Malaysia International Conference on…
2009
Corpus ID: 12742785
We propose the use of an MDS (Maximum Distance Separable) code in multi-route cooperative multi-hop relaying networks. The effect…
Expand
2008
2008
Generalized IRA Erasure Correcting Codes for Hybrid Iterative/Maximum Likelihood Decoding
E. Paolini
,
G. Liva
,
B. Matuz
,
M. Chiani
IEEE Communications Letters
2008
Corpus ID: 43059634
The design of low-density parity-check (LDPC) codes under hybrid iterative / maximum likelihood decoding is addressed for the…
Expand
2008
2008
Multipath Key Establishment for Wireless Sensor Networks Using Just-Enough Redundancy Transmission
Jing Deng
,
Y. Han
IEEE Transactions on Dependable and Secure…
2008
Corpus ID: 6822664
In random key predistribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from…
Expand
2008
2008
Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC
E. Paolini
,
G. Liva
,
M. Varrella
,
B. Matuz
,
M. Chiani
4th Advanced Satellite Mobile Systems
2008
Corpus ID: 6967997
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are…
Expand
2005
2005
THE MARKET PRICE OF CREDIT RISK
K. Giesecke
,
L. Goldberg
2005
Corpus ID: 11016917
We describe the relationship between physical probability of default and prices of credit sensitive securities. Our starting…
Expand
2003
2003
Turbo-like codes over the block fading channel: code design and construction
A. G. Fàbregas
2003
Corpus ID: 52086182
Transmission of turbo-like codes over block fading channels is addressed. We present a novel construction based on blockwise…
Expand
2002
2002
On Near-MDS Elliptic Codes
M. Giulietti
2002
Corpus ID: 2435366
The main conjecture on maximum distance separable (MDS) codes states that, execpt for some special cases, the maximum length of a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE