27 search results - page 4 / 6 » Bounds on the Covering Radius of Linear Codes |
100
Voted
SIAMDM
1998
15 years 1 months ago
1998
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
133
click to vote
TIT
2010
14 years 8 months ago
2010
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
113
Voted
COCOON
2009
Springer
15 years 8 months ago
2009
Springer
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...
175
click to vote
Book
The book covers several topics such as Acyclic Networks, Cyclic Networks, Network Coding and Algebraic Coding, Superposition Coding and Max-Flow Bound, Network Codes for Acyclic Ne...
94
Voted
MCSS
2007
Springer
15 years 1 months ago
2007
Springer
We provide a generalized version of the nonlinear small gain theorem for the case of more than two coupled input-to-state stable (ISS) systems. For this result the interconnection...