搜索结果: 31-45 共查到“知识库 代数编码理论”相关记录103条 . 查询时间(2.687 秒)
Adaptive Set Observers Design for Nonlinear Continuous-Time Systems: Application to Fault Detection and Diagnosis
Adaptive observers nonlinear continuous-time systems fault detection interval residuals
2010/12/28
The paper deals with joint state and parameter estimation for nonlinear continuous-time systems. Based on a guaranteed LPV approximation, the set adaptive observers design problem is solved avoiding t...
Local-Testability and Self-Correctability of q-ary Sparse Linear Codes
Local-Testability Self-Correctability q-ary Sparse Linear Codes
2011/3/3
We prove that q-ary sparse codes with small bias are self-correctable and locally testable. We generalize a result of Kaufman and Sudan [3] that proves the local testability and correctability of bina...
We present the interactive Java-based open-source traffic simulator available at www.traffic-simulation.de.In contrast to most closed-source commercial simulators, the focus is on investigating fundam...
The penalty incurred by imposing a finite delay constraint in lossless source coding of a memoryless source is investigated.
A discrete-time intersymbol interference channel with additive Gaussian noise is considered, where only the receiver has knowledge of the channel impulse response. An approach for combining decision-f...
Supercuspidal characters of $\operatorname{SL}_2$ over a $p$-adic field
p-adic group character formula supercuspidal representation
2011/2/28
The character formulas of [42] are an early triumph in p-adic har-monic analysis, but, to date, the calculations underlying the formulas have not been available.
This paper investigates universal polar coding schemes. In particular, a notion of ordering (called convolutional path) is introduced between probability distributions to determine when a polar compre...
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.