- Reed-Solomon (RS) code is an error-correcting code rst described in apaper by Reed and Solomon in 1960. Since that time they've been appliedin CD-ROMs, wireless communications, space communications, DSL, DVD,and digital TV
- Reed Solomon codes are a subset of BCH codes and are linear block codes. A Reed-Solomon code is specified as RS( n,k ) with s -bit symbols. This means that the encoder takes k data symbols of s bits each and adds parity symbols to make an n symbol codeword
- •For a Reed Solomon code with parameters n (block size), k (message size), q (symbol size in bits), we encode the message as a polynomial p(x), and then multiply with a code generator polynomial g(x) •Map the message vector [x 1 x k] to a polynomial p(x) of degree < k such that: •Can be done using Lagrange interpolation
- The basic method for decoding Reed-Solomon codes proceeds by applying this method, for j = 0,1,...,n −k 2 2 and ν = n−k−2j 2, to the sequence S 1,S 2,...,S 2ν until the matrix equation (1) has a unique solution. Then, the error-locator polynomial is factored and the error-magnitudes are found
- Reed-Solomon code. Problem: Communicate n packets m1;:::;mn on noisy channel that corrupts k packets. Reed-Solomon Code: 1.Make a polynomial, P(x) of degree n 1, that.

Reed-Solomon CodesV Claim If F is not the 0message, then Enc(F) can have at most 3zeros. BecauseF isanon-zeropolynomialofdegree(atmost)3,itcan haveatmost3zeros. Reed-Solomon **Reed** - **Solomon** **Code** is a type of block **code**. **Reed** - **Solomon** **Code**. **Reed** - **Solomon** error correcting **codes** are one of the oldest **codes** that were introduced in 1960s by Irving S. **Reed** and Gustave **Solomon**. It is a subclass of non - binary BCH **codes**. BCH **codes** (Bose-Chaudhuri-Hocquenghem **codes**) are cyclic ECCs that are constructed using polynomials over data blocks Reed-Solomon Implementation The rest of the presentation is about my implementation Done in Python with no external libraries or dependencies Implemented a Finite Field class for GF(28) Implemented a Polynomial Class for manipulating polynomials Implemented the RS algorithms as described Implementing Reed-Solomon - p. 2 Reed - Solomon Codes An introduction to Reed - Solomon codes: principles, architecture and implementation 1. Introduction Reed - Solomon codes are block-based error correcting codes with a wide range of Reed - Solomon 和Cauchy Reed - Solomon 解码时间复杂度为什么不 * Reed-Solomon-Codes (kurz RS-Codes) sind eine Klasse zyklischer Blockcodes*. Sie werden im Rahmen der Kanalkodierung zum Erkennen und Korrigieren von Übertragungs- oder Speicherfehlern als Teil einer Vorwärtsfehlerkorrektur eingesetzt. Sie bilden eine Unterklasse der allgemeinen Klasse der BCH-Codes

Reed-Solomon codes use a generator polynomial similar to BCH codes (not to be confused with the generator number alpha). The generator is the product of factors ( x - α n ), starting with n =0 for QR codes. For example: g4 ( x) = ( x - α 0) ( x - α 1) ( x - α 2) ( x - α 3) The same as (x + a i) because of GF (2^8) They are Reed-Solomon error codes: the extremely powerful codes that provide critical error control for many different types of digital communications systems. This outstanding collection of thirteen original articles written by leading researchers in the field provides a uniquely comprehensive overview of the history and practical applications--some never before published--of these important codes Reed-Solomon codes and Generalized Reed-Solomon codes ¶ Given n different evaluation points α1, , αn from some finite field F, the corresponding Reed-Solomon code (RS code) of dimension k is the set: {f(α1), , f(αn) ∣ f ∈ F[x], degf < k ** A commonly used block code is the Reed-Solomon (RS) code, which is used for channels where bursts of noise (impulsive noise) are expected**. The NASA standard Reed-Solomon code (n = 255 k = 223), with an interleaving depth of 5, adds 160 bytes of redundancy to every 1115 bytes of information. This code can correct an error burst 80 bytes in length

- Reed-Solomon algorithm Click calculate to run the Reed-Solomon CODEC. Polynomial coefficients can be displayed in either decimal form or as powers of the primitive element, and may be rendered in either ascending or descending order
- Properties A Reed-Solomon code is specified as RS(n,k) with s-bit symbols. Maximum codeword length (n) for a Reed-Solomon code is n = 2s - 1 This means that the encoder takes k data symbols of s bits each and adds parity symbols to make an n symbol codeword. There are n-k parity symbols of s bits each. A Reed-Solomon decoder can correct up to.
- Le code de Reed-Solomon est un code correcteur basé sur les corps finis dont le principe est de construire un polynôme formel à partir des symboles à transmettre et de le suréchantillonner. Le résultat est alors envoyé, au lieu des symboles originaux

* Reed-Solomon Codes - Properties, Advantages, Applications, Generator Polynomial(ITC Hindi Classes)Information Theory and Coding Lectures for Engineering Stud*.. Also, a Reed-Solomon code is a linear code (adding two code words produces another code word) and it is cyclic (cyclically shifting the symbols of a code word produces another code word). It belongs to the family of Bose-Chaudhuri-Hocquenghem (BCH) codes [3, 4], but is distinguished by having multi-bit symbols. This makes the code particularly good at dealing with bursts of error

- Reed-Solomon code was invented in 1960 [1]. The RS(n;k), where n denotes length of codeword, kdenotes number of data symbols and there are n kcontrol symbols is able theoretically to correct up to t= n k 2 er-rors. Reed-Solomon code may be seen as non-binary BCH (Bose- Chaudhuri-Hocquenghem) code and particular decoding algorithms for BCH code can be used together for Reed-Solomon code
- Description. Schifra is a very robust, highly optimized and extremely configurable Reed-Solomon error correcting code library for both software and IP core based.
- 里德-所羅門碼（ Reed-solomon codes ，簡稱里所碼或 RS codes ）是一種前向錯誤更正的信道編碼，對由校正過採樣資料所產生的有效多項式。編碼過程首先在多個點上對這些多項式求冗餘，然後將其傳輸或者儲存

About Press Copyright Contact us Creators Advertise Developers Terms Privacy Policy & Safety How YouTube works Test new features Press Copyright Contact us Creators. The Reed-Solomon code, like the convolutional code, is a transparent code. This means that if the channel symbols have been inverted somewhere along the line, the decoders will still operate. The result will be the complement of the original data. However, the Reed-Solomon code loses its transparency if virtual zero fill is used Reed Solomon Codes Reed Solomon code is a linear cyclic systematic non-binary block code. RS codes operate on the information by dividing the message stream into blocks of data, adding redundancy per block depending only on the current inputs. It is capable to correct both burst errors and erasures. 13 Storia. Il codice fu inventato nel 1960 da Irving S. Reed e Gustave Solomon, che al tempo lavoravano al Lincoln laboratory del Massachusetts Institute of Technology (MIT). Il lavoro fu pubblicato nell'articolo Codici polinomiali su alcuni campi finiti (Polynomial Codes over Certain Finite Fields).. Ma nel 1960 la tecnologia digitale non era sufficientemente avanzata per realizzare il concetto

リード・ソロモン符号（リード・ソロモンふごう、Reed-Solomon Coding、RS符号と略記）とは符号理論における誤り訂正符号の一種、訂正能力が高く様々なデジタル機器等で応用されている In coding theory, folded Reed-Solomon codes are like Reed-Solomon codes, which are obtained by mapping Reed-Solomon codewords over a larger alphabet by careful bundling of codeword symbols.. Folded Reed-Solomon codes are also a special case of Parvaresh-Vardy codes.. Using optimal parameters one can decode with a rate of R, and achieve a decoding radius of 1 − R

Generalized Reed-Solomon Codes In 1960, I.S. Reed and G. Solomon introduced a family of error-correcting codes that are doubly blessed. The codes and their generalizations are useful in prac-tice, and the mathematics that lies behind them is interesting. In the rst sec-tion we give the basic properties and structure of the generalized Reed-Solomon Given a symbol size s, the maximum codeword length (n) for a Reed Solomon code is n = 2s - 1. For example, the maximum length of a code with 8-bit symbols (s=8) is 255 bytes. Reed Solomon codes may be shortened by (conceptually) making a number of data symbols zero at the encoder, not transmitting them, and then re-inserting them at the decoder The Reed-Solomon code, like the convolutional code, is a transparent code. This means that if the channel symbols have been inverted somewhere along the line, the decoders will still operate. The result will be the complement of the original data. However, the Reed-Solomon code loses its transparency when the code is shortened (see below) Figure 1 - Reed-Solomon code definitions Also, a Reed-Solomon code is a linear code (adding two code words produces another code word) and it is cyclic (cyclically shifting the symbols of a code word produces another code word). It belongs to the family of Bose-Chaudhuri-Hocquenghem (BCH) codes [3, 4], but is distinguished b

5.2.2 Hamming code 101 5.2.3 Reed-Solomon codes 102 5.3 Noisy Main Channel 103 5.4 Noiseless Main Channel and Partly Observed Message 107 5.5 Concluding Remarks 111 6. Biometrics 6.1 Biometric Authentication 115 6.2 Biometric Reconstruction 117 6.3 The Juels-Wattenberg Scheme 12 These codes are specified as RS (n, k), with m bit symbols. This means that the encoder takes k data symbols of m bits each, appends n - k parity symbols, and produces a code word of n symbols ( each of m bits). Reed Solomon codes are based on a specialized area of mathematics known as Galois fields (a.k.a. finite fields) codes. In 1959, Irving Reed and Solomon described a new class of error-correcting codes called Reed- Solomon codes. RS codes have been one of the most widely used ECC schemes, mainly because the coding scheme allows for efficient correction of both burst and random errors. RS is a block scheme because i International Journal of Computer Science and Information Security (IJCSIS), Vol. 14, No. 12, December 2016 Reed Solomon Encoding: Simplified Explanation for Programmers Frimpong Twum1, J.B. Hayfron-Acquah2, W.W. Oblitey3, William Morgan-Darko4 1,2,4 Department of Computer Science, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana 3 Department of Computer Science, Indiana. This is a .NET implementation of the Reed-Solomon algorithm, supporting .NET Standard 1.0. My work was mostly and turn an existing mathematician-friendly implementation into a developer-friendly one. Also, this implementation focuses on a specific case where the Galois field order is precisely the amount of values a byte can contain

Reed-Solomon error-correcting code decoder Introduction. Reed-Solomon codes allow an arbitrary message to be expanded with redundant information, transmitted over a noisy channel, and decoded such that if the received message has fewer errors than a predefined number, then the original message can be recovered perfectly Reed-Solomon Erasure Code engine in Go, could more than 15GB/s per core. Picocrypt. Reed-Solomon codes are nonbinary cyclic codes with symbols made up of m-bit sequences, where m is any positive integer having a value greater than 2. R-S ( n , k

* Matlab is one of the weighty tools to fulfill the Reed Solomon codes*. In fact, it offers bags of toolboxes and functions to encode and decode actions. What Makes Reed Solomon Be Future Trending Technique Reed-Solomon codes are usually referred to as (n,k) codes, where n is the total number of symbols in a code block and k is the number of information or data symbols. In a systematic code, the complete code block is formed from the k data symbols, followed by the n-k check symbols

Description. This example will demonstrate using C++ how to instantiate a **Reed-Solomon** encoder and decoder, add the full amount of possible errors, correct the errors, and output the various pieces of relevant information. The **Reed-Solomon** **code's** properties are as follows: Symbol size: 8-bits. Codeword length: 255. Number of data symbols: 223 rrenc - reads all of files which are to be written into XCD, computes an array of redundant data (usual 16-bit Solomon-Reed code) and prepares paramfile for mode2cdmaker; rrdec - reads all of files (including redundant data) from XCD and writes them to your hard disk, computes the contents of damaged sectors and insert them into proper places.

VHDL code Layout for Reed-Solomon Encoder. In FIGURE is reported an example of a layout on Cyclone IV Altera/Intel FPGA. As clear from the report in Figure 5 the Reed-Solomon encoder RS(7,3) takes only 37 logic element and 34 registers. The timing analysis reports a 474 MHz as the clock frequency Using the Reed-Solomon algorithm to produce the required number of codewords 00010000 00100000 00001100 01010110 01100001 10000000 11101100 00010001 11101100 00010001 11101100 00010001 11101100 00010001 11101100 00010001 10100101 00100100 11010100 11000001 11101101 00110110 11000111 10000111 00101100 0101010 BCH codes (Wicker & Bhargava, 1999). 1.2.4 Reed and Solomon Irving Reed (1923- ) is an American mathematician and engineer who is best known for co-inventing a class of algebraic codes known as Reed-Solomon codes (RS codes) in collaboration with Gustave Solomon (1930-1996). R * Title On the Performance of Concatenated Reed-Solomon, Convolutional and Parity Check Codes for BWA Applications Date Submitted 2000-06-27 Source(s) Qian Hongyi Centre for Wireless Communications 20 Science Park Road, #02-34/37 Teletech Park, Singapore 117674 Voice: 65-8709 230 or 65-8709 229 Fax: 65-7795 441 mailto:qianhy@cwc*.nus.edu.s

Set the parameters for the Reed-Solomon code, where N is the codeword length, K is the nominal message length, and S is the shortened message length. Set the modulation order, M, and the number of frames, L The Reed-Solomon Decoder LogiCORE module is a high speed, compact design that implements many different Reed-Solomon coding standards including G.709, DVB, ATSC, IEES and CCSDS. The core is fully synchronous, using a single clock, and supports continuous input data with no gap between code blocks. The core is parameterizable, allowing designers. Reed-Solomon (RS) codes are very efficient a nd best for correction of burst . errors and have a wide range of ap plications in digital communication and data storage. Reed-Solom on (RS) is the Reed-Solomon Identification. Reed-Solomon Identification (RSID) of digital modes is a creation of Patrick Lindecker, F6CTE, and kindly released to the public domain. It is used in several digital mode programs. Patrick maintains the master list of code / mode assignments in order to maintain compatibility between these programs Reed-Solomon is an erasure code with exactly the properties we needed for file storage, and it is simple and straightforward to implement. Erasure Codes and Storage. Erasure coding is standard practice for systems that store data reliably, and many of them use Reed-Solomon coding. The RAID system built into Linux uses Reed-Solomon

Reed-Solomon codes for coders, free practical beginner's tutorial with Python code examples on WikiVersity. Partially written by one of the authors of the present software. Algebraic codes for data transmission, Blahut, Richard E., 2003, Cambridge university press. Readable online on Google Books. This book was pivotal in helping. ** List-decoding of Reed-Solomon (RS) codes beyond the so called Johnson radius has been one of the main open questions since the work of Guruswami and Sudan**. It is now known by the work of Rudra and Wootters, using techniques from high dimensional probability, that over large enough alphabets most RS codes are indeed list-decodable beyond this radius. In this paper we take a more combinatorial. The Reed-Solomon code has a very simple definition, especially for those of you who have read about secret sharing.. Given a prime power and integers , the Reed-Solomon code with these parameters is defined by its encoding function as follows.. Generate explicitly.; Pick distinct elements .; A message is a list of elements .Represent the message as a polynomial Reed-Solomon II IP Core User Guide Subscribe Send Feedback UG-01090 2016.05.02 101 Innovation Drive San Jose, CA 95134 www.altera.co decoded = rsdec (code,n,k) attempts to decode the received signal in code using an [ n, k] Reed-Solomon decoding process with the narrow-sense generator polynomial. code is a Galois array of symbols having m bits each. Each n -element row of code represents a corrupted systematic codeword, where the parity symbols are at the end and the.

• Code generator polynomial: (x + λ) (x + λ^2) (x + λ^3) (x + λ^16). • Field generator polynomial: x^8+ x^4+ x^3+ x^2+1. • This version of the Reed Solomon core is distributed under the GPL license. An optimized and considerably more advanced version, which may be customized on request for different code generator polynomials, i Browse other questions tagged c++ generator qr-code error-correction reed-solomon or ask your own question. The Overflow Blog Podcast 364: What's the blast radius when your database goes down? The Overflow #84 and 85: How Dwarf Fortress is built. Featured on Meta Join me in Welcoming Valued Associates: #945 - Slate - and #948 - Vanny. Description. code = rsenc(msg,n,k) encodes the message in msg using an [n,k] Reed-Solomon code with the narrow-sense generator polynomial. msg is a Galois array of symbols having m bits each. Each k-element row of msg represents a message word, where the leftmost symbol is the most significant symbol.n is at most 2 m-1.If n is not exactly 2 m-1, rsenc uses a shortened Reed-Solomon code Reed-Solomon Codes and Their Applications . 1999. Abstract. No abstract available. Cited By. Peng F, Jiang W, Qi Y, Lin Z and Long M (2020) Separable Robust Reversible Watermarking in Encrypted 2D Vector Graphics, IEEE Transactions on Circuits and Systems for Video Technology, 30:8, (2391-2405), Online publication date: 1-Aug-2020 Hardent's ECC/Reed-Solomon FEC IP portfolio targets a wide range of applications on both FPGA and ASIC technology. In addition to IP cores targeted at specific applications, we also offer customized Reed-Solomon or BCH encoder and decoder IP cores based on customer-specific parameters

- Reed-Solomon codes) — недвоичные циклические коды, позволяющие исправлять ошибки в блоках данных. Элементами кодового вектора являются не биты, а группы битов (блоки)
- Reed Solomon Encoder/Decoder on the StarCore™ SC140/SC1400 Cores, With Extended Examples, Rev. 1 Freescale Semiconductor 3 The Reed-Solomon codes are block codes. Unlike convolutional codes, Reed-Solomon codes operate on multi-bit symbols rather than on individual bits. The question of whether to choose convolutional codes or block codes
- Decoding algorithms for Reed-Solomon codes provide extensions and generalizations of Shamir's method. References 1 Berlekamp, E.R. Algebraic Coding Theory. McGraw-Hill, New York, 1968. Google Scholar; 2 McEliece, R.J. The Theory of Information and Coding. Addison- Wesley, Reading MA, 1977
- RS codes are systematic linear block code. It is a block code because the code is put together by splitting the original message into fixed length blocks. RS encoder is designated as (N,K,T) where, N is the number of overall bytes after encoding K is the number of data bytes before encoding T is the number of data bytes which can be corrected.
- This class implements Reed-Solomon encoding schemes used in processing QR codes. A very brief description of Reed Solomon encoding is here: Reed-Solomon Codes
- Shortened, Punctured and Concatenated Reed-Solomon Codes - WiMAX IEEE 802.16d standard; Project Activity. See All Activity > Follow Schifra C++ Reed Solomon ECC Library. Schifra C++ Reed Solomon ECC Library Web Site. Other Useful Business Software. Keep IT up and running with Systems Management Bundle
- RS Encoder or Reed Solomon Encoder VHDL source code. This page of VHDL source code covers RS Encoder or Reed Solomon Encoder vhdl code.The RS encoder implementation mentioned here is as per specifications on RS encoder MATLAB source code mentioned in matlab source code section

The shortened Reed-Solomon code may be implemented by adding 51 bytes, all set to zero, before the information bytes at the input of an RS (255,239, t = encoder. After the RS coding procedure these null bytes shall be discarded, leading to a RS code word of N = 204 bytes * Iterative soft decoding of Reed-Solomon codes*. Jing Jiang. Related Papers. Iterative Soft-Input Soft-Output Decoding of Reed-Solomon Codes by Adapting the Parity-Check Matrix. By Jing Jiang. A comparison of adaptive belief propagation and the best graph algorithm for the decoding of linear block codes

The Reed-Solomon code is a [n, k, n − k + 1] code; in other words, it is a linear block code of length n (over F) with dimension k and minimum Hamming distance n − k + 1. The Reed-Solomon code is optimal in the sense that the minimum distance has the maximum value possible for a linear code of size (n, k); this is known as the Singleton. Reed-Solomon codes are effective for burst errors and they are used for erasure decoding. Reed-Solomon codes are used in some electronic devices such as CDs, DVDs, and Blu-ray, and they are also employed in communication technologies such as DSL, WiMAX, or RAID 6. Reed-Solomon codes are invented in 1960, and they are seen as nonbinary BCH codes Reed-Solomon Original. La versión pensada por Irving S. Reed y Gustave Solomon era muy sencilla. Pero tenía un problema, se comprobó que a la práctica era ineficiente si los valores de los parámetros eran grandes. Definición Original. La idea es que a partir de una información, creamos un polinomio The Reed-Solomon code is actually a family of codes, where every code is characterised by three parameters: an alphabet size q, a block length n, and a message length k, with k < n ≤ q. The set of alphabet symbols is interpreted as the finite field of order q, and thus, q has to be a prime power

Reed-Solomon Codes 1 Introduction A Reed-Solomon (RS) code is an error-correcting code rst described in a paper by Reed and Solomon in 1960 [9]. Since that time they've been applied in CD-ROMs, wireless communications, space communications, DSL, DVD, and digital TV. RS encoding data is relatively straightforward, but decoding is time Parameters of Reed - Solomon Codes. A Reed-Solomon code is specified as RS(n,k). Here, n is the block length which is recognizable by symbols, holding the relation, n = 2 m - 1. The message size is of k bits. So the parity check size is (n - k) bits. The code can correct up to (t) errors in a codeword, where (2t = n - k). The following diagram. Recall Reed-Solmon represents messages as polynomials and over-samples them for redundancy. An (n,k,n−k +1) code has k digit messages n digit codewords n−k +1 distance between codewords (at least) (n−k)/2 errors before it cannot be decoded 2s = n−k In this presentation, all messages and codewords ar Lecture 13: Reed-Solomon Codes with an Example Created Date: 3/1/2017 8:51:30 AM. An RS code is often called classical if alphai = αi − 1 and α is a primitive n 'th root of unity. More generally, given also n column multipliers β1, , βn , the corresponding Generalized Reed-Solomon code (GRS code) of dimension k is the set: {(β1f(α1), , βnf(αn) ∣ f ∈ F[x], degf < k

Reed-Solomon (RS) codes are an important subclass of non-binary BCH codes. RS codes have a true minimum distance which is the maximum possible for a linear (n, k) code, as in Equation 14.27.They are therefore examples of maximum-distance-separable codes Description. Schifra is a very robust, highly optimized and extremely configurable **Reed-Solomon** error correcting **code** library for both software and IP core based. Information Thoery & Coding(ITC): https://www.youtube.com/playlist?list=PLOuGMjEXHeeAv5Ejeo4xz3BHM2-0cN8nNFormula Revision Videos: https://www.youtube.com/pl.. Reed-Solomon Codes: A Historical Overview (I. Reed and G. Solomon). Reed-Solomon Codes and the Exploration of the Solar System (R. McEliece and L. Swanson). Reed-Solomon Codes and the Compact Disc (K. Immink). Algorithms and Architectures for the Design of a VLSI Reed-Solomon Codes (A. Hasan, et al.) Reed-Solomon Codes - Martyn Riley and Iain Richardson Engineering CS144 unit 7-4 - Stanford University An Introduction to Reed-Solomon Codes - Wicker and Bhargav

- 리드솔로몬 적부호 (Reed Solomon Product Code: RSPC)는 통신이나 기록 재생시에 삽입될 수 있는 오류를 제거하는 정정을 수행하기 위해서 추가로 패리티 (용장) 자료를 생성하여 붙여두며 재생 또는 수신 시에 오증을 발생시키고 오류의 위치를 파악하며 오류의 값을.
- Reed-Solomon Interactive Dem
- Reed solomon codes - SlideShar
- Code de Reed-Solomon — Wikipédi

- Istenhez hanyatló árnyék beszédhelyzet.
- Málnalekvár variációk.
- Napfivér holdnővér online magyarul.
- Asteraceae család jellemzése.
- Gyömbéres szirup.
- Mac kozmetikumok.
- Kerti kemence árak.
- Vw golf variant teszt.
- 2021 naptár nyomtatható.
- Paleo gyümölcsös torta.
- Élelmiszerek nyomon követése.
- Mikor lehet olaszországba utazni.
- Zenei stílusok és előadók.
- Étterem hegykő.
- Konyhai kisegítő zalaegerszeg.
- Cheddar sajt 1kg.
- Renault thalia 1.4 16v motor.
- Mindenki fogadjon örökbe egy kiskutyát alapítvány.
- Réz fali lámpa.
- Kezdődő nyaki gerincsérv.
- Bmw r 1250 gs adventure adatok.
- Myasthenia gravis leszázalékolás.
- Levélpapír minta.
- Iniciálé rajzolás.
- U bass.
- Horgászfelszerelések.
- Fekete fehér nyomtatás.
- Pasztell hajfesték.
- Tejszínes rakott krumpli darált hússal.
- Búvár túrós.
- Sturmgewehr 44 vs ak 47.
- Univerzum vagy multiverzum.
- Globus gombás melegszendvicskrém.
- Négy évszak vendégház balatonboglár.
- Fatmagül 107 rész.
- Hajtetováló toll olcsón.
- Hogyan mondjam el hogy szeretem.
- Boszorkány mágia könyv.
- Fehér munkás rövidnadrág.
- Kundalini energia.
- Gyerekdalok bogyó és Babóca.