73,559 research outputs found
D.O. Reed, commission agent, sole agent of New England for "Reed's Gilt Edge Tonic" ...
No full textTrade card advertising Reed's Gilt Edge Tonic, a remedy prepared by Geo. W. M. Reed & Co., New Haven, and marketed in New England by D.O. Reed, Hartford, Ct
The use of reed canary-grass (Phalaris arundinacea) as a short fibre raw material for the pulp and paper industry
No full textThis thesis describes the use of delayed harvested reed canary-grass (Phalaris arundinacea) as a short fibre raw material for the pulp and paper industry. This study examines the following aspects of reed canary-grass: quality, transportation, storage, refining of the raw material by dry fractionation, chemical pulping, bleaching and paper production. The delayed harvesting method of reed canary-grass produces an economically and environmentally sustainable short fibre raw material for the pulp and paper industry. The ash content and fibre properties of reed canary-grass depend on soil type and growing location. The yearly variation in fibre yield and fibre properties is also considerable. There is, however, a potential for minimising quality variations by choosing reed canary-grass varieties suitable to a specific growing location. The leaf and leaf sheath content of reed canary-grass also affects the quality of the pulp. These quality variations can be eliminated by dry fractionation, a method that removes the unwanted parts of the grass. These unwanted parts can be used as a valuable bio-fuel raw material. Transport of reed canary grass after fractionation can be improved by briquetting, a method that doubles the transport capacity of reed canary-grass compared to that of birch logs on a fibre basis. High quality short fibre chemical pulp can be produced from reed canary-grass. The whole process from grass production to pulp production has been demonstrated successfully in full scale. Bleached reed canary-grass pulp can be used in products such as fine paper and white-top liner paper
Reed-solomon forward error correction (FEC) schemes, RFC 5510
No full textThis document describes a Fully-Specified Forward Error Correction (FEC) Scheme for the Reed-Solomon FEC codes over GF(2^^m), where m is in {2..16}, and its application to the reliable delivery of data objects on the packet erasure channel (i.e., a communication path where packets are either received without any corruption or discarded during transmission). This document also describes a Fully-Specified FEC Scheme for the special case of Reed-Solomon codes over GF(2^^8) when there is no encoding symbol group. Finally, in the context of the Under-Specified Small Block Systematic FEC Scheme (FEC Encoding ID 129), this document assigns an FEC Instance ID to the special case of Reed-Solomon codes over GF(2^^8).
Reed-Solomon codes belong to the class of Maximum Distance Separable (MDS) codes, i.e., they enable a receiver to recover the k source symbols from any set of k received symbols. The schemes described here are compatible with the implementation from Luigi Rizzo
A Reed-Solomon Coded DS-CDMA System Using Noncoherent M-ary Orthogonal Modulation over Multipath Fading Channels
No full textThe performance of Reed–Solomon (RS) coded direct-sequence code division multiple-access (DS-CDMA) systems using noncoherent M-ary orthogonal modulation is investigated over multipath Rayleigh fading channels. Diversity reception techniques with equal gain combining (EGC) or selection combining (SC) are invoked and the related performance is evaluated for both uncoded and coded DS-CDMA systems. "Errors-and-erasures" decoding is considered, where the erasures are based on Viterbi’s so-called ratio threshold test (RTT). The probability density functions (PDF) of the ratio associated with the RTT conditioned on both the correct detection and erroneous detection of the M-ary signals are derived. These PDFs are then used for computing the codeword decoding error probability of the RS coded DS-CDMA system using "errors-and-erasures" decoding. Furthermore, the performance of the "errors-and-erasures" decoding technique employing the RTT is compared to that of "error-correction-only" decoding refraining from using side-information over multipath Rayleigh fading channels. As expected, the numerical results show that when using "errors-and-erasures" decoding, RS codes of a given code rate can achieve a higher coding gain than without erasure information. Index Terms—Direct sequence code division multiple-access, error-correction-only decoding, errors-and-erasures decoding, noncoherent -ary orthogonal signaling, ratio threshold test, Reed–Solomon codes
Desenvolvimento em linguagem de descrição de hardware de codificador e decodificador Reed-Solomon
No full textDissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia Elétrica, Florianópolis, 2014.Atualmente, diversos sistemas de comunicação demandam grandes volumes de tráfego de dados para consumo quase instantâneo. Estes dados devem ser entregues aos usuários tal qual foram gerados: sem erros. Por isso, técnicas de controle e correção de erros estão intrinsecamente ligadas aos sistemas que realizam trocas de dados, sejam sistemas de armazenamento, os quais estão sujeitos a falhas durante a leitura, ou sistemas de comunicação, que estão sujeitos às adversidades do meio (radiação, interferência eletromagnética, desvanecimento, entre outros). Neste cenário, os códigos Reed-Solomon representam uma solução viável para inúmeras aplicações, bem como pesquisas acadêmicas, mesmo tanto tempo após sua invenção. Este trabalho realiza um estudo da teoria que embasa os códigos Reed-Solomon, assim como implementa as técnicas do estado-da-arte dos módulos que compõem tanto o codificador quanto o decodificador, as quais são prototipadas em hardware reconfigurável.<br
FNT-based reed-solomon erasure codes
No full textThis paper presents a new construction of Maximum-Distance Separable (MDS) Reed-Solomon erasure codes based on Fermat Number Transform (FNT). Thanks to FNT, these codes support practical coding and decoding algorithms with complexity O(n log n), where n is the number of symbols of a codeword. An open-source implementation shows that the encoding speed can reach 150Mbps for codes of length up to several 10,000s of symbols. These codes can be used as the basic component of the Information Dispersal Algorithm (IDA) system used in a several P2P systems
Dataset supporting the publication "Buried 3D spot-size converters for silicon photonics"
No full textData underlying the results presented in the paper W. Zhang, M. Ebert, J. D. Reynolds, B. Chen, X. Yan, H. Du, M. Banakar, D. T. Tran, C. G. Littlejohns, G. T. Reed, and D. J. Thomson, "Buried 3D spot-size converters for silicon photonics," Optica 8, 1102-1108 (2021)</span
Cypridina roxoensis Reed 1929
No full textCypridina roxoensis Reed 1929 (nomen dubium) Fig. 5 B Cyridina roxoensis Reed 1929: 67, pl. 4, fig. 13. Holotype Monotypic. Type locality Rox Rois No. 13 (Horizon A), Brasil, Upper Triassic. Material Specimen not examine herein. Distribution Upper Triassic, Brasil. Diagnosis Elongate with broadly rounded anterior and posterior margins and linear dorsal margin. Short vertical sulcus extends from hingeline to large central pit. Surface pitted and with low swellings. Length 3–4 mm. Comparisons Differs from M. hollandica in having straight dorsal margin. Remarks Not a Myodocopina. Resembles Paleozoic Leperditellidae. The senior author enquired about the specimen from the Sedgwick Museum, Cambridge, where Reed may have worked, but it was not in the museum records and could not be found in their collections (D. Pemberton & M. Lowe, email, 4 / 11 / 2006).Published as part of Kornicker, Louis S., Van, Barry W. M., Bakel, Fraaije, René H. B. & Jagt, John W. M., 2006, Revision of Mesozoic Myodocopina (Ostracoda) and a new genus and species, Mesoleberis hollandica, from the Upper Cretaceous of Belgium and The Netherlands, pp. 15-54 in Zootaxa 1246 on pages 45-46, DOI: 10.5281/zenodo.17293
D-1770: 449 South Main, Logan, Utah, Newel G. Misener /Reed G. and Elice M. Misner/Sarah E. Mitton residence
No full textD-1770: 449 South Main, Logan, Utah, Newel G. Misener /Reed G. and Elice M. Misner/Sarah E. Mitton residenc
Using the First Order Reed-Muller Code for Channels With Unknown Offset
No full textWhile the Minimum Euclidean Distance detection is known to be optimal for channels affected by Gaussian noise, it has been shown that Minimum Pearson Distance detection (MPD) may perform better when the channel is also affected by an unknown offset, though for a good performance some adaptations for classical binary block codes are necessary. It is shown for cosets of first order Reed-Muller codes R(1,m) containing words of weight d/2, where d is the code's distance, that the minimum Pearson distance is always low for m≤4. However, it is possible to find cosets where the minimum Pearson distance is higher for m≥5.Applied Mathematic
- …
