搜索结果: 1-15 共查到“代数学 Coding”相关记录23条 . 查询时间(0.028 秒)
Coding for Network Coding
Sparse graph codes probabilistic channel models Shannon channel capacity network coding
2015/8/20
We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include node- or link- failures, Byzantine behavior of nodes, or an over-estimate of the...
SNEED: Enhancing Network Security Services Using Network Coding and Joint Capacity
Network Security Services Network Coding Joint Capacity
2011/3/3
Traditional network security protocols depend mainly on developing cryptographic schemes and on using biometric methods. These have led to several network security protocols that are unbreakable based...
On Transmit Antenna Selection for Multiuser MIMO Systems with Dirty Paper Coding
Transmit Antenna Selection Multiuser MIMO Systems Dirty Paper Coding
2011/1/19
Abstract—In this paper, we address the transmit antenna selection in multi-user MIMO systems with precoding. The optimum and reduced complexity sub-optimum antenna selection algorithms are introduced.
Coding for High-Density Recording on a 1-D Granular Magnetic Medium
High-Density Recording 1-D Granular Magnetic Medium
2011/1/19
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent on each other and al...
Noisy channel coding via privacy amplification and information reconciliation
Noisy channel coding privacy amplification information reconciliation
2011/3/3
We show that optimal protocols for noisy channel coding of public or private information over either classical or quantum channels can be directly constructed from two more primitive information-theor...
Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols
Quantum Network Coding Schemes Classical Nonlinear Protocols
2011/3/3
The k-pair problem in network coding theory asks to send k messages simultaneously between k
source-target pairs over a directed acyclic graph. In a previous paper [ICALP 2009, Part I, pages 622–633]...
The penalty incurred by imposing a finite delay constraint in lossless source coding of a memoryless source is investigated.
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...
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...
An Infinite Surface With The Lattice Property I: Veech Groups and Coding Geodesics
The Lattice Property I Veech Groups Coding Geodesics
2010/11/9
We study the symmetries and geodesics of an infinite translation surface which arises as a limit of translation surfaces built from regular polygons, studied by Veech. We find the affine symmetry grou...
Novel Codes Family for Modified Spectral-Amplitude-Coding OCDMA Systems and Performance Analysis
Novel Codes Family Modified Spectral-Amplitude-Coding OCDMA Systems Performance Analysis
2010/12/10
In this paper a novel family of codes for modified spectral-amplitude-coding optical code division multiple access (SAC-OCDMA) is introduced. The proposed codes exist for more number of processing gai...
In [13], K¨otter and Kschischang presented a new model for error correcting codes in network coding. The alphabet in this model is the subspace lattice of a given vector space.
Relay Selection with Network Coding in Two-Way Relay Channels
Relay Selection Network Coding Two-Way Relay Channels
2010/12/13
Abstract—In this paper, we consider the design of joint network coding (NC) and relay selection (RS) in two-way relay channels.In the proposed schemes, two users first sequentially broadcast their res...
Morphological dilation image coding with context weights prediction
quad-tree coding morphological dilation variable-length group test coding weights training
2010/12/14
This paper proposes an adaptive morphological dilation image coding with context weights prediction. The new dilation method is not to use fixed models, but to decide whether a coefficient needs to be...
Applications of semidefinite programming to coding theory
Applications semidefinite programming to coding theory
2010/12/1
We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is...