Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 8th International Co Shojiro Sakata Conference proceedings 1991 Springer-

Crepitus

Pseudo-polyphase orthogonal sequence sets with good cross-correlation property,e orthogonal sequences, is introduced from a maximum length sequence (m-sequence) by the inverse DFT, where . is the period of sequences..A periodic sequence is called an orthogonal sequence, when the autocorrelation function is 0 in every term except for period-multiple-shift terms. It is known tha

conflate

Coded modulation with generalized multiple concatenation of block codes,d as a code in the euclidean space ... One obtains a concatenated code in the euclidean space .. using binary block codes. In this paper the obtained code is taken as an inner code, which is concatenated with block codes once again. The advantage of this multiple concatenation compared to single con

細(xì)節(jié)

Trellis coded modulation based on time-varying mapping and encoders for utilizing a channel intersydean free distance(..) and obtain large coding gain by intentionally utilizing intersymbol interference(ISI) in a channel. If .-ary modulation signals are transmitted in a channel with ISI, the received signals will be mapped into more than . signal points due to ISI,i.e. a channel memory. In the pr

breadth

Some ideas about fault-tolerant Chinese Remaindering, an . upper bound on the number of erroneous residues is known. A specific application would be for residue number codes (as distinct from quadratic residue codes). We generalise the method of Ramachandran, and present two general algorithms for this problem, along with two special cases one of whic

詩集

Inelasticity

Single exponential path finding in semialgebraic sets Part I: The case of a regular bounded hypersu by a boolean combination of polynomial inequalities. We describe an algorithm which decides in single exponential sequential time and polynomial parallel time whether x. and x. are contained in the same semialgebraically connected component of V. If they do, the algorithm constructs a continuous se

coddle

ODIUM

未成熟

Agnessa O. Inshakova,Igor P. Marchukovachieve much larger .. and lower BER than the Ungerboeck‘s coded 4PSK using the time-invariant mapping and encoder in a channel without ISI, providing that their decoding complexity is equivalent. The improvement can increase as a constraint length of the encoder.