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

FEMUR

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes978-3-540-47489-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

结构

Hallowed

https://doi.org/10.1007/3-540-54195-0Algorithms; algebra; algorithm; communication; computer; computer science; error-correcting code; combinato

PLE

978-3-540-54195-0Springer-Verlag Berlin Heidelberg 1991

粘

统治人类

Error-coded algorithms for on-line arithmetic,ne arithmetic operations in which the results are generated during the digit-serial input of the operands, beginning always with the most significant digit. The error detection/correction method effectively uses low-cost arithmetic codes since the interconnections between on-line modules are of mini

myelography

Constructions of codes correcting burst asymmetric errors,, where . is the maximal length of correctable burst asymmetric errors and . is the number of information symbols. The codes have less check symbols than ordinary burst-error-correcting codes if log.(.−1).+log. log..<.. A decoding algorithm for the codes is also presented. Encoding and decoding of t

甜瓜

CHOIR

Feasible calculation of the generator for combined LFSR sequences, module of all homogeneous LFSR sequences in R generated by f(x)..The purpose of our paper is to determine the generating polynomial of the recurrence sequences obtained by multiplying the outputs of these LFSRs. When R is a finite field, we present a new explicit and computationally feasible method

OASIS