搜索结果: 46-60 共查到“知识库 代数编码理论”相关记录103条 . 查询时间(5 秒)
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 ...
Classification of quaternary Hermitian self-dual codes of length 20
Classification quaternary Hermitian self-dual codes of length 20
2011/1/18
A classification of quaternary Hermitian self-dual codes of length 20 is given.Using this classification, a classification of extremal quaternary Hermitian self-dual codes of length 22 is also given.
Towards a Low-Complexity Dynamic Decode-and-Forward Relay Protocol
Low-Complexity Dynamic Decode-and-Forward Relay Protocol
2011/1/17
The dynamic decode-and-forward (DDF) relaying protocol is a relatively new cooperative scheme
which has been shown to achieve promising theoretical results in terms of diversity-multiplexing gain tra...
Channel-coded Collision Resolution by Exploiting Symbol Misalignment
Channel-coded Collision Resolution Symbol Misalignment
2010/12/9
In random-access networks, such as the IEEE 802.11 network, different users may transmit their packets simultaneously,resulting in packet collisions.
Approximation of DAC Codeword Distribution for Equiprobable Binary Sources along Proper Decoding Paths
DAC Codeword Distribution Equiprobable Binary Sources Proper Decoding Paths
2010/12/13
Distributed Arithmetic Coding (DAC) is an effective implementation of Slepian-Wolf coding, especially for short data blocks. To research its properties, the concept of DAC codeword distribution along ...
Efficient Information Aggregation Strategies for Distributed Control and Signal Processing
Efficient Information Aggregation Strategies Distributed Control Signal Processing
2010/12/14
This thesis will be concerned with distributed control and coordination of networks consisting of multiple, potentially mobile, agents. This is motivated mainly by the emergence of large scale network...
Multiple Access Channels with Cooperative Encoders and Channel State Information
Multiple Access Channels Cooperative Encoders Channel State Information
2010/12/14
The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A twouser
MAC with common messag...
Tree-Structure Expeactation Propagation for LDPC Decoding in Erasure Channels
heavy tails truncation second order regular variation
2010/12/9
The problem of estimating the tail index from truncated data is addressed in Chakrabarty and Samorodnitsky (2009). In that paper.
For an operator T ∈ B(X, Y ), we denote by am(T ), cm(T ), dm(T ), and tm(T ) its pproximation, Gelfand, Kolmogorov, and absolute numbers. We show that,for any infinite dimensional Banach spaces X and...