Filters








14 Hits in 5.4 sec

On the complexity of decoding Goppa codes (Corresp.)

D. Sarwate
1977 IEEE Transactions on Information Theory  
These results are based on the application of efficient computational techniques to the decoding algorithms recently discovered by Sugiyama, Kasahara, Hirasawa, and Namekawa.  ...  It is shown that i) erasures-and-errors decoding of Goppa codes can be done using O(n log2 n) arithmetic operations, ii) long primitive binary Bose-Chaudhuri-Hocquenghem (BCH) codes can be decoded using  ...  Using an errors-only decoding algorithm for this code, one can find the syndrome using O(n log n) arithmetic operations and the error-locator polynomial using O(t log2 t) arithmetic operations.  ... 
doi:10.1109/tit.1977.1055732 fatcat:2lvl3z7lfjfgvklvdwc3tchcqu

Wyner - Ziv theory for a general function of the correlated sources (Corresp.)

H. Yamamoto
1982 IEEE Transactions on Information Theory  
Rissanen, "Compression of black-white images with binary arithmetic coding," IEEE Abstract-A source coding problem is considered for the Wyner-Ziv type system where the decoder is required to estimate  ...  Helman did the programming of the code and contributed to the skew number update algorithm. [II PI [31 [41 I51 REFERENCES G. G. Langdon, Jr., and J.  ... 
doi:10.1109/tit.1982.1056560 fatcat:yw7uwfn6vzbmfgfsck5ovphehy

On the distribution of the number of computations in any finite number of subtrees for the stack algorithm (Corresp.)

R. Johannesson, K. Zigangirov
1985 IEEE Transactions on Information Theory  
Multitype branching processes have been employed to determine the stack algorithm computational distribution for one subtree.  ...  These results are extended here to the distribution of the number of computations in any finite number of subtrees.  ...  The results in [5] were obtained for random tree codes, while in [4] we considered the class of binary, rate l/2, complementary + random tree codes, a fictitious entity that is a reasonable model for  ... 
doi:10.1109/tit.1985.1057001 fatcat:dxavlu452zde7bovmlioftqwhy

Transmission and reconstruction of signals using functionally related zero crossings (Ph.D. Thesis abstr.)

F. Marvasti
1975 IEEE Transactions on Information Theory  
It is shown that Goppa codes can be decoded up to their guaranteed capabilities by a simple modification of a Reed-Solomon decoder. Various bounds on the performance of Goppa codes are derived.  ...  A Hamming-like upper bound on the minimum distance of cyclic AN-codes is derived from expressions for the volume of modular arithmetic spheres that are developed in this dissertation.  ... 
doi:10.1109/tit.1975.1055476 fatcat:gh4l445wnjem7dfkfl3lyii7ai

1983 Index IEEE Transactions on Computers Vol. C-32

1983 IEEE transactions on computers  
Logic arrays Asynchronous sequential logic circuits equivalence of arbiter, synchronizer, latch, and inertial delay. Barros, Coding/decoding; cf.  ...  Optimality of a two-phase strategy for routing in interconnection networks (Corresp.); T-CSep 83 861-863 Varanasi, M. R., T. R. N. Rao, and Son Pham.  ... 
doi:10.1109/tc.1983.1676190 fatcat:xsogjoynp5dt7mqu6dy4tiodfq

Abstracts of Current Computer Literature

1971 IEEE transactions on computers  
Most of the encoding and decoding algorithms for error correcting codes are implemented in a serial fashion.  ...  The derivation of all the C classes and subsequent prime C classes has been illustrated by Grasselli and Luccio and relies on maximal C-class decomposition.  ... 
doi:10.1109/t-c.1971.223383 fatcat:vz3bijyj7bgjrkwzhjmw3pjzgm

OpenEAR — Introducing the munich open-source emotion and affect recognition toolkit

Florian Eyben, Martin Wollmer, Bjorn Schuller
2009 2009 3rd International Conference on Affective Computing and Intelligent Interaction and Workshops  
We herein introduce a novel open-source affect and emotion recognition engine, which integrates all necessary components in one highly efficient software package.  ...  The engine is tailored for multi-threaded, incremental on-line processing of live input in real-time, however it can also be used for batch processing of databases. 978-1-4244-4799-2/09/$25.00 c 2009 IEEE  ...  . coefficients and corresp. approx. err. 4 Quadratic reg. coefficients and corresp. approx. err. 5 Discrete Cosine Transf.  ... 
doi:10.1109/acii.2009.5349350 dblp:conf/acii/EybenWS09 fatcat:af2nxb7rr5h2fkkg2fvrexqcxe

Comparison Four Different Probability Sampling Methods based on Differential Evolution Algorithm

Qingbo Lu, Xueliang Zhang, Shuhua Wen, Guosheng Lan
2012 Journal of Advances in Information Technology  
Accurate segmentation of medical images is a key step in the use of computer-aided diagnosis (CAD) systems to improve the sensitivity and specificity of lesion detection.  ...  Abstract-Differential Evolution (DE) is one kind of evolution algorithm, which based on difference of individuals. DE has exhibited good performance on optimization problem.  ...  ACKNOWLEDGMENT The authors wish to thank management of Goel Group of Institutions, Lucknow for providing sponsorship in this endeavor.  ... 
doi:10.4304/jait.3.4.206-214 fatcat:lt35ulkqwfbbbikn6xtlfhcoty

Accelerating XOR-based Erasure Coding using Program Optimization Techniques [article]

Yuya Uezato
2021 arXiv   pre-print
This paper addresses a significant performance gap between the state-of-the-art XOR-based EC approach (with 4.9 GB/s coding throughput) and Intel's high-performance EC library based on another approach  ...  We propose a novel approach based on our observation that XOR-based EC virtually generates programs of a Domain Specific Language for XORing byte arrays.  ...  ACKNOWLEDGMENTS We gratefully thank anonymous reviewers for their invaluable and thorough comments, which improved the presentation of this paper and also helped us improve the performance of our experimental  ... 
arXiv:2108.02692v1 fatcat:tyolry4355gt5pqhbferp6pnuu

Integral biomathics: A post-Newtonian view into the logos of bios

Plamen L. Simeonov
2010 Progress in Biophysics and Molecular Biology  
It is focused on the phenomena of emergence, adaptive dynamics and evolution of self-assembling, self-organizing, self-maintaining and self-replicating biosynthetic systems viewed from a newly-arranged  ...  This work is an attempt for a state-of-the-art survey of natural and life sciences with the goal to define the scope and address the central questions of an original research program.  ...  Acknowledgements: The author deeply appreciates the valuable help of Prof. Tatsuya Nomura from  ... 
doi:10.1016/j.pbiomolbio.2010.01.005 pmid:20146929 fatcat:ukagr4ftyjaqvknyjorvewxavm

MovieDIRec: Drafted-Input-Based Recommendation System for Movies

Hyeonwoo An, Daeyeol Kim, Kwangkee Lee, Nammee Moon
2021 Applied Sciences  
In a DNN-based recommendation system, the input selection of a model and design of an appropriate input are very important in terms of the accuracy and reflection of complex user preferences.  ...  In this paper, the effects of properly designed and generated inputs on accuracy and usability are verified using the proposed systems.  ...  The model consists of an encoder model that compresses input features and a decoder model that approximates the original by expanding the compressed code information.  ... 
doi:10.3390/app112110412 fatcat:3s2joawacncrboopw3c4e7senu

MATRIX DESIGNS AND METHODS FOR SECURE AND EFFICIENT COMPRESSED SENSING A doctoral dissertation by

Valerio Cambareri
unpublished
the Decoder The choice of a suitable wavelet family for the UDWT and of a decoding algorithm for solving (1.24) are crucial for a fair evaluation of CS.  ...  For the sake of brevity, in each example we select and report the algorithm that yields the most accurate recovery quality at a lower- class decoder as the amount of perturbation varies.  ... 
fatcat:bjbhyt3otfeujaufklyj7ticqu

VLSI Implementation of a Spiking Neural Network

Andreas Grübl
2007
To extend the operation of the VLSI model to multiple chips, an event routing algorithm has been developed that enables the communication between neurons and synapses located on different chips, thereby  ...  The functional performance of the event routing algorithm is shown in simulations.  ...  HANNEE: Heidelberg Analog Neural Network Evolution Environment Algorithm 2 Pseudo code to describe the implemented algorithm to convert a vector of events into a playback memory program.  ... 
doi:10.11588/heidok.00007457 fatcat:qqckyygwqjc5zkb5baetjktas4

Diagrammatic Reasoning Skills of Pre-Service Mathematics Teachers

Margaret Karrass
2017
This study attempted to explore a possible relationship between diagrammatic reasoning and geometric knowledge of pre-service mathematics teachers.  ...  In the course of this study, a group of volunteers in the last semester of their teacher preparation program were presented with "visual proofs" of certain theorems from high school mathematics curriculum  ...  of the perpendicular b), … I wonder if this is sufficient … and to use similarity … a nice question to ask in class … Can you prove constructing two lines and then constructing only oneand which one  ... 
doi:10.7916/d8pk0p5m fatcat:mm5zpsitovcm3cnd3geajuya3e