Sciweavers

363 search results - page 4 / 73
» Code Generation for Polynomial Multiplication
Sort
View
DM
2008
112views more  DM 2008»
13 years 7 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
13 years 7 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
GLOBECOM
2006
IEEE
14 years 1 months ago
Cyclic Codes Tailored to a Known Set of Error Patterns
— We propose a high-rate error-pattern control code based on a generator polynomial targeting a specific set of known dominant error patterns. This code is based on first const...
Jihoon Park, Jaekyun Moon
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
13 years 11 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...
ICMCS
2005
IEEE
145views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Error Resilient Multiple Description Coding Based on Wavelet Tree Coding and EREC for Wireless Networks
In this paper, we propose an integrated error resilient MDC scheme for wireless networks with both packet loss and random bit errors. Two descriptions are first generated independ...
Daewon Song, Lei Cao, Chang Wen Chen