A Solution to the Polynomial Hensel Code Conversion Problem

The polynomial Hensel code of a rational function a(x)/ b(x) ϵ F(x), F is a field, is the pair (c(x) d-1(x) mod Xr, n); r is a positive integer and a(x)/ b(x) = (c(x))xn such that c(x) and d(x) have nonzero constant terms. Such a representation scheme was proposed, in analogy with the Hensel code re...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on computers Ročník C-36; číslo 5; s. 634 - 637
Hlavní autor:	MUKHOPADHYAY, A
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.05.1987 Institute of Electrical and Electronics Engineers
Témata:	Algebraic simplification algorithm design Applied sciences Arithmetic Built-in self-test Circuits Codes Coding, codes Complexity theory Computers Euclidean algorithm Exact sciences and technology Fault tolerance Fault tolerant systems Hensel code Information, signal and communications theory Logic gates Polynomials rational function representation Signal and communications theory Telecommunications and information theory Design Algorithm Code Conversion Rational function
ISSN:	0018-9340, 1557-9956
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!