Skip to search formSkip to main contentSkip to account menu

Protoglossum viscidum

Known as: Cortinomyces viscidus, Cortinomyces viscidus (Massee & Rodway) Bougher & Castellano, Protoglossum viscidum (Massey & Rodway) T.W.May 
National Institutes of Health

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Majority Voting Procedure Allowing Soft Decision Decoding of Linear Block Codes on Binary Channels
In this paper we present an efficient algorithm to decode linear block codes on binary channels. The main idea consists in using… 
2012
2012
Efficient Berlekamp-Massey based recursive decoder for Reed-Solomon codes
This paper presents a high speed low complexity algorithm and architecture for encoding and decoding Reed-Solomon (RS) codes… 
2012
2012
AN IMAGE ENCRYPTION APPROACH USING STREAM CIPHERS BASED ON NONLINEAR FILTER GENERATOR
In this work a novel image encryption scheme using stream cipher algorithm based on nonlinear filter generator is considered. In… 
2010
2010
Design and Implementation of Reed-Solomon Decoder using Decomposed Inversion less Berlekamp-Massey Algorithm
2006
2006
High Throughput and Low Power Reed Solomon Decoder for Ultra Wide Band
Reed Solomon (RS) codes are widely used in a variety of communication sys- tems. Continual demand for ever higher data rates… 
2004
2004
Design of new pseudorandom generators based on a filtered FCSR automaton
Feedback with Carry Shift Registers (FCSR) were introduced by M. Goresky and A. Klapper in 1993. They are very similar to… 
2004
2004
High Throughput Reed Solomon Decoder for Ultra Wide Band
Reed Solomon (RS) codes have been widely used in a variety of communication systems such as space communication link, digital… 
2001
2001
Implementation of a Hermitian decoder IC in 0.35 /spl mu/m CMOS
This paper presents the first integrated circuit implementation of a Hermitian decoder thereby proving its practical viability… 
1999
1999
Delincuencia y represión en la Castilla bajomedieval : (los territorios castellano-manchegos)
1998
1998
An algorithm for computing a shortest linear recurrence relation for a sequence of matrices: generalizing the Berlekamp-Massey algorithm
The Berlekamp-Massey algorithm (1968) iteratively constructs a shortest linear recurrence relation for a finite sequence of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)