Relevant bibliographies by topics / Berlekamp-Massey algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers
  5. Reports

Academic literature on the topic 'Berlekamp-Massey algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Berlekamp-Massey algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Berlekamp-Massey algorithm"

1

Cheng, M. H. "Generalised Berlekamp–Massey algorithm." IEE Proceedings - Communications 149, no. 4 (2002): 207. http://dx.doi.org/10.1049/ip-com:20020413.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Atti, Nadia Ben, Gema M. Diaz–Toca, and Henri Lombardi. "The Berlekamp-Massey Algorithm revisited." Applicable Algebra in Engineering, Communication and Computing 17, no. 1 (2006): 75–82. http://dx.doi.org/10.1007/s00200-005-0190-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kaltofen, Erich, and George Yuhasz. "On the matrix berlekamp-massey algorithm." ACM Transactions on Algorithms 9, no. 4 (2013): 1–24. http://dx.doi.org/10.1145/2500122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bras-Amorós, Maria, and Michael E. O’Sullivan. "The Symmetric Key Equation for Reed–Solomon Codes and a New Perspective on the Berlekamp–Massey Algorithm." Symmetry 11, no. 11 (2019): 1357. http://dx.doi.org/10.3390/sym11111357.

Full text
Abstract:
This paper presents a new way to view the key equation for decoding Reed–Solomon codes that unites the two algorithms used in solving it—the Berlekamp–Massey algorithm and the Euclidean algorithm. A new key equation for Reed–Solomon codes is derived for simultaneous errors and erasures decoding using the symmetry between polynomials and their reciprocals as well as the symmetries between dual and primal codes. The new key equation is simpler since it involves only degree bounds rather than modular computations. We show how to solve it using the Euclidean algorithm. We then show that by reorgan
APA, Harvard, Vancouver, ISO, and other styles
5

Kaltofen, Erich, and George Yuhasz. "A fraction free Matrix Berlekamp/Massey algorithm." Linear Algebra and its Applications 439, no. 9 (2013): 2515–26. http://dx.doi.org/10.1016/j.laa.2013.06.016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Henkel, W. "Another description of the Berlekamp-Massey algorithm." IEE Proceedings I Communications, Speech and Vision 136, no. 3 (1989): 197. http://dx.doi.org/10.1049/ip-i-2.1989.0028.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Youzhi, Xu. "Implementation of Berlekamp—Massey algorithm without inversion." IEE Proceedings I Communications, Speech and Vision 138, no. 3 (1991): 138. http://dx.doi.org/10.1049/ip-i-2.1991.0018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hsie-Chia Chang and C. B. Shung. "New serial architecture for the Berlekamp-Massey algorithm." IEEE Transactions on Communications 47, no. 4 (1999): 481–83. http://dx.doi.org/10.1109/26.764911.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

O'Sullivan, Michael E. "New Codes for the Berlekamp–Massey–Sakata Algorithm." Finite Fields and Their Applications 7, no. 2 (2001): 293–317. http://dx.doi.org/10.1006/ffta.2000.0283.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Reed, I. S., M. T. Shih, and T. K. Truong. "VLSI design of inverse-free Berlekamp—Massey algorithm." IEE Proceedings E Computers and Digital Techniques 138, no. 5 (1991): 295. http://dx.doi.org/10.1049/ip-e.1991.0040.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Berlekamp-Massey algorithm"

1

Šicner, Jiří. "Srovnání algoritmů dekódování Reed-Solomonova kódu." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219300.

Full text
Abstract:
The work deals with the encoding and decoding of Reed-Solomon codes. There is generally described algebraic decoding of Reed-Solomon codes, and then described four methods of decoding, namely Massey-Berlekamp algorithm, Euclidean algoritus, Peterson-Gorenstein-Zierler algorithm and the direct method. These methods are then compared, and some of them are implemented in Matlab.
APA, Harvard, Vancouver, ISO, and other styles
2

Frolka, Jakub. "BCH kódy." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219462.

Full text
Abstract:
The work deals with data security using BCH codes. In the work are described BCH codes in binary and non-binary form, and their most important subclass RS codes. Furthermore, this work describes the method of decoding Peterson-Gorenstein-Zierl, Berlekamp- Massey and Euclidean algorithm. For the presentation of encoding and decoding process, the application was created in Matlab, which has two parts – Learning BCH codes and Simulation of BCH codes. Using the generated application performance of BCH codes was compared at the last part of the work.
APA, Harvard, Vancouver, ISO, and other styles
3

Ben, Atti Nadia. "Calcul rapide sur les matrices structurées : Les matrices de Hankel." Phd thesis, Université de Franche-Comté, 2008. http://tel.archives-ouvertes.fr/tel-00477090.

Full text
Abstract:
Cette thèse présente une contribution à l'amélioration de certains résultats concernant les algorithmes en Algèbre linéaire et plus particulièrement les algorithmes sur les matrices structurées. Nous présentons un nouvel algorithme de diagonalisation par blocs des matrices de Hankel, particulièrement efficace. Dans le cas où la matrice de Hankel correspond à une suite récurrente linéaire, nous retrouvons ainsi l'algorithme de Berlekamp-Massey, mais dans une version simplifiée (plus facile à expliquer et à programmer) et accélérée par des troncatures. En outre notre version permet une gestion d
APA, Harvard, Vancouver, ISO, and other styles
4

Thomé, Emmanuel. "Algorithmes de calcul de logarithmes discrets dans les corps finis." Phd thesis, Ecole Polytechnique X, 2003. http://tel.archives-ouvertes.fr/tel-00007532.

Full text
Abstract:
Le calcul de logarithmes discrets est un problème central en cryptologie. Lorsqu'un algorithme sous-exponentiel pour résoudre ce problème existe, le cryptosystème concerné n'est pas nécessairement considéré comme disqualifié, et il convient d'actualiser avec soin l'état de l'art de la cryptanalyse. Les travaux de ce mémoire s'inscrivent dans cette optique. Nous décrivons en particulier comment nous avons atteint un record de calculs de logarithmes discrets: \GFn(607).<br /><br />Dans une première partie, nous exposons les différentes améliorations que nous avons apportées à l'algorithme de Cop
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Yan-Hua, and 陳延華. "The Implementation of Reed-Solomon Code Using Inversionless Berlekamp Massey Algorithm." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/52044991794880134460.

Full text
Abstract:
碩士<br>義守大學<br>資訊工程學系<br>87<br>Recently, the Reed-Solomon (RS) code of burst errors correcting has been widely applied to multimedia systems. The syndrome polynomial of RS code is normally used to obtain error locator polynomial. In the past, the most techniques mainly focus on the Euclidean algorithm to calculate the error locator and evaluator polynomial. However, the Berlekamp Massey (BM)[1][27] algorithm may have even better performance on the Reed Solomon (RS) decoder on solving more errors. On the other hand, the IBM algorithm is more suitable in developing of the hardware. Thi
APA, Harvard, Vancouver, ISO, and other styles
6

Jason and 陳建霖. "The Implementation of Berlekamp Massey Algorithm Based on Micro-cpu Design." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/46721052763724517127.

Full text
Abstract:
碩士<br>大葉大學<br>電機工程學系<br>97<br>In this thesis, we devise a micro-cpu, such that Berlekamp-Massey algorithm is performed. A syndrome polynomial computation, an error-location polynomial calculation and its error-location solutions are included. Machine codes are written with iteration structures which can lower the complexity of hardware design. In order to implement Berlekamp-Massey algorithm in a micro-cpu, we design a simple element inversion circuit that performs an inversion in a Galois Field with the least hardware. After simulations are performed correctly by a software ModelSim, a synthe
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Lon-Sin, and 李榮財. "Algebraic Decoding of (23, 12, 7) Quadratic Residue Code Using Berlekamp-Massey Algorithm." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/48498336030892453339.

Full text
Abstract:
碩士<br>義守大學<br>電機工程學系<br>92<br>In this thesis, we apply an algebraic decoding method that is proposed for the quadratic residue codes. By utilize the Berlekamp-Massey (BM) algorithm, we could decode QR codes. To utilize Berlekamp-Massey algorithm, we need to 2t consecutive syndromes. Unfortunately in QR code, there are always some syndromes missing. Therefore, according to presented relations of documentation, we utilize know syndromes instead of unknown syndromes. Then, we can utilize Berlekamp-Massey algorithm to find error locator polynomial and solve QR code. In this
APA, Harvard, Vancouver, ISO, and other styles
8

Yuhasz, George L. "Berlekamp/Massey algorithms for linearly generated matrix sequences." 2009. http://www.lib.ncsu.edu/theses/available/etd-03242009-100736/unrestricted/etd.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Berlekamp-Massey algorithm"

1

Canteaut, Anne. "Berlekamp–Massey Algorithm." In Encyclopedia of Cryptography and Security. Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_335.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kailath, Thomas. "Encounters with the Berlekamp-Massey Algorithm." In Communications and Cryptography. Springer US, 1994. http://dx.doi.org/10.1007/978-1-4615-2694-0_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kuijper, Margreet. "The Berlekamp-Massey algorithm, error-correction, keystreams and modeling." In Dynamical Systems, Control, Coding, Computer Vision. Birkhäuser Basel, 1999. http://dx.doi.org/10.1007/978-3-0348-8970-4_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zarowski, Christopher J. "A divisionless form of the Schur Berlekamp-Massey algorithm." In Information Theory and Applications. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57936-2_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sakata, S. "Decoding 2D Cyclic Codes by Paralleling the 2D Berlekamp-Massey Algorithm." In Eurocode ’92. Springer Vienna, 1993. http://dx.doi.org/10.1007/978-3-7091-2786-5_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gashkov, S. B., and I. B. Gashkov. "The Berlekamp-Massey Algorithm. A Sight from Theory of Pade Approximants and Orthogonal Polynomials." In Computational Science - ICCS 2004. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24687-9_72.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sakata, Shojiro, and Masazumi Kurihara. "A fast parallel implementation of the Berlekamp-Massey algorithm with a 1D systolic array architecture." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60114-7_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sakata, Shojiro. "N-dimensional Berlekamp-Massey algorithm for multiple arrays and construction of multivariate polynomials with preassigned zeros." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51083-4_72.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bras-Amorós, Maria, and Michael E. O’Sullivan. "From the Euclidean Algorithm for Solving a Key Equation for Dual Reed–Solomon Codes to the Berlekamp–Massey Algorithm." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02181-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mou, Chenqi, and Xiaolin Fan. "On Berlekamp–Massey and Berlekamp–Massey–Sakata Algorithms." In Computer Algebra in Scientific Computing. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-26831-2_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Berlekamp-Massey algorithm"

1

Ilani, Ishai. "Berlekamp-Massey Algorithm: Euclid in Disguise." In 2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE). IEEE, 2018. http://dx.doi.org/10.1109/icsee.2018.8646027.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Chao, Yunghsiang S. Han, Zhongfeng Wang, and Baoming Bai. "A New Inversionless Berlekamp-Massey Algorithm with Efficient Architecture." In 2019 IEEE International Workshop on Signal Processing Systems (SiPS). IEEE, 2019. http://dx.doi.org/10.1109/sips47522.2019.9020488.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lim, Hyeonchan, Junghwan Kim, Soyeon Kang, and Sungho Kang. "Test data reduction method based on berlekamp-massey algorithm." In 2017 International SoC Design Conference (ISOCC). IEEE, 2017. http://dx.doi.org/10.1109/isocc.2017.8368800.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lima Silva, Veronica Maria, Raimundo Carlos Silverio Freire, and Cleonilson Protasio de Souza. "Arbitrary waveform generator based on the Berlekamp-Massey Algorithm." In 2016 1st International Symposium on Instrumentation Systems, Circuits and Transducers (INSCIT). IEEE, 2016. http://dx.doi.org/10.1109/inscit.2016.7598203.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yan, Zhiyuan, and Dilip V. Sarwate. "Universal Reed-Solomon decoders based on the Berlekamp-Massey algorithm." In Proceedins of the 14th ACM Great Lakes symposium. ACM Press, 2004. http://dx.doi.org/10.1145/988952.988965.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Khuntia, Ashirbad, and Trailokya Nath Sasamal. "A novel transient fault injection technique using Berlekamp-Massey Algorithm." In 2014 International Conference on Advanced Communication, Control and Computing Technologies (ICACCCT). IEEE, 2014. http://dx.doi.org/10.1109/icaccct.2014.7019144.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lin, Tsung-Ching, and Trieu-Kien Truong. "Decoding nonsystematic Reed-Solomon codes using the Berlekamp-Massey algorithm." In SPIE Optical Engineering + Applications, edited by Arun K. Majumdar and Christopher C. Davis. SPIE, 2011. http://dx.doi.org/10.1117/12.894465.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Redinbo, Robert. "Correcting DFT Codes with Modified Berlekamp-Massey Algorithm and Syndrome Extension." In 2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing (PRDC). IEEE, 2011. http://dx.doi.org/10.1109/prdc.2011.39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Giesbrecht, Mark, Erich Kaltofen, and Wen-shin Lee. "Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm." In the 2002 international symposium. ACM Press, 2002. http://dx.doi.org/10.1145/780506.780519.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Park, Jeong-In, Kihoon Lee, Chang-Seok Choi, and Hanho Lee. "High-speed low-complexity Reed-Solomon decoder using pipelined Berlekamp-Massey algorithm." In 2009 International SoC Design Conference (ISOCC). IEEE, 2009. http://dx.doi.org/10.1109/socdc.2009.5423927.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Berlekamp-Massey algorithm"

1

CAMPBELL, PHILIP L. An Implementation of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm in the C Programming Language. Office of Scientific and Technical Information (OSTI), 1999. http://dx.doi.org/10.2172/12658.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography