搜索结果: 76-90 共查到“代数编码理论”相关记录141条 . 查询时间(4.946 秒)
Belief-propagation-based joint channel estimation and decoding for spectrally efficient communication over unknown sparse channels
belief propagation message passing compressive sensing compressed sensing
2011/2/24
We consider spectrally-efficient communication over a Rayleigh N-block-fading channel with a K-
sparse L-length discrete-time impulse response (for 0
We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a codecheckable group ring is introduced.
Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance
Improved linear programming LDPC codes bounds minimum fractional distance
2011/1/19
We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation,and thus improving the LP decoder...
This paper concerns application of feedback in LT codes. The considered type of feedback is acknowledgments,where information on which symbols have been decoded is given to the transmitter.
A New Noncoherent Decoder for Wireless Network Coding
New Noncoherent Decoder Wireless Network Coding
2011/3/1
This work deals with the decoding aspect of wireless network coding in the canonical two-way relay channel where two senders exchange messages via a common relay and they receive the mixture of two me...
Throughput and Latency in Finite-Buffer Line Networks
Throughput Latency Finite-Buffer Line Networks
2011/1/21
This work investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures a...
Study of Throughput and Latency in Finite-buffer Coded Networks
Study of Throughput Latency Finite-buffer Coded Networks
2011/1/21
Exact queueing analysis of erasure networks with network coding in a finite buffer regime is an extremely hard problem due to the large number of states in the network.
Multiple-access Network Information-flow and Correction Codes
Multiple-access Network Information-flow Correction Codes
2011/1/17
This work considers the multiple-access multicast error-correction scenario over a packetized network with z malicious edge adversaries.
Flash memory is well-known for its inherent asymmetry:the flash-cell charge levels are easy to increase but are hard to decrease.
Classification of self-dual codes of length 36
Classification self-dual codes of length 36
2011/2/28
A complete classification of binary self-dual codes of length 36 is given.
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
graph drawing planar graphs slopes planar slope number
2011/2/22
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct ed...
Localized endomorphisms in Kitaev's toric code on the plane
Localized endomorphisms Kitaev's toric code
2011/2/22
We consider various aspects of Kitaev’s toric code model on a plane in the C-algebraic approach to quantum spin systems on a lattice. In par-ticular, we show that elementary excitations of the ground...
On triply even binary codes
binary code divisible code doubly even code triangular graph framed vertex operator algebra
2011/2/22
A triply even code is a binary linear code in which the weight of every codeword is divisible by 8. We show how two doubly even codes of lengths m1 and m2 can be combined to make
a triply even code o...
A New Formula for the BER of Binary Modulations with Dual-Branch Selection over Generalized-K Composite Fading Channels
A New Formula for the BER of Binary Dual-Branch Selection Generalized-K Composite Channels
2011/2/22
Error performance is one of the main performance measures and derivation of its closed-form
expression has proved to be quite involved for certain systems. In this letter, a unified closed-form expre...
Dense locally testable codes cannot have constant rate and distance
Dense locally testable codes constant rate distance
2011/3/2
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important question is whether there ...