Literatura académica sobre el tema "Linear block codes"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Linear block codes".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Linear block codes"
Litwin, L. y K. Ramaswamy. "Linear block codes". IEEE Potentials 20, n.º 1 (2001): 29–31. http://dx.doi.org/10.1109/45.913209.
Texto completoFeng, Keqin, Lanju Xu y Fred J. Hickernell. "Linear error-block codes". Finite Fields and Their Applications 12, n.º 4 (noviembre de 2006): 638–52. http://dx.doi.org/10.1016/j.ffa.2005.03.006.
Texto completoDubey, Pankaj, Neelesh Gupta y Meha Shrivastva. "Non Coherent Block Coded Modulation using Linear Components Codes". International Journal of Computer Applications 91, n.º 13 (18 de abril de 2014): 5–8. http://dx.doi.org/10.5120/15939-5097.
Texto completoTolhuizen, L. "New binary linear block codes (Corresp.)". IEEE Transactions on Information Theory 33, n.º 5 (septiembre de 1987): 727–29. http://dx.doi.org/10.1109/tit.1987.1057346.
Texto completoCaire, G. y E. Biglieri. "Linear block codes over cyclic groups". IEEE Transactions on Information Theory 41, n.º 5 (1995): 1246–56. http://dx.doi.org/10.1109/18.412673.
Texto completoSklar, B. y F. J. Harris. "The ABCs of linear block codes". IEEE Signal Processing Magazine 21, n.º 4 (julio de 2004): 14–35. http://dx.doi.org/10.1109/msp.2004.1311137.
Texto completoTang, Li y Aditya Ramamoorthy. "Coded Caching Schemes With Reduced Subpacketization From Linear Block Codes". IEEE Transactions on Information Theory 64, n.º 4 (abril de 2018): 3099–120. http://dx.doi.org/10.1109/tit.2018.2800059.
Texto completoWei, Ruey-Yi, Tzu-Shiang Lin y Shi-Shan Gu. "Noncoherent Block-Coded TAPSK and 16QAM Using Linear Component Codes". IEEE Transactions on Communications 58, n.º 9 (septiembre de 2010): 2493–98. http://dx.doi.org/10.1109/tcomm.2010.09.090413.
Texto completoSole, Patrick y Virgilio Sison. "Quaternary Convolutional Codes From Linear Block Codes Over Galois Rings". IEEE Transactions on Information Theory 53, n.º 6 (junio de 2007): 2267–70. http://dx.doi.org/10.1109/tit.2007.896884.
Texto completoMicheli, Giacomo y Alessandro Neri. "New Lower Bounds for Permutation Codes Using Linear Block Codes". IEEE Transactions on Information Theory 66, n.º 7 (julio de 2020): 4019–25. http://dx.doi.org/10.1109/tit.2019.2957354.
Texto completoTesis sobre el tema "Linear block codes"
Spyrou, Spyros. "Linear block codes for block fading channels based on Hadamard matrices". Texas A&M University, 2005. http://hdl.handle.net/1969.1/3136.
Texto completoYildiz, Senay. "Construction Of Substitution Boxes Depending On Linear Block Codes". Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605540/index.pdf.
Texto completoA Construction of Resilient Functions with High Nonlinearity"
by T. Johansson and E. Pasalic in 2000, and two years later in "
Linear Codes in Generalized Construction of Resilient Functions with Very High Nonlinearity"
by E. Pasalic and S. Maitra are compared and the former one is observed to be more promising in terms of nonlinearity. The first construction method uses a set of nonintersecting [n-d,m,t+1] linear block codes in deriving t-resilient S-boxes of nonlinearity 2^(n-1)-2^(n-d-1),where d is a parameter to be maximized for high nonlinearity. For some cases, we have found better results than the results of Johansson and Pasalic, using their construction. As a distinguished reference for nxn S-box construction methods, we study the paper "
Differentially Uniform Mappings for Cryptography"
presented by K.Nyberg in Eurocrypt 1993. One of the two constructions of this paper, i.e., the inversion mapping described by Nyberg but first noticed in 1957 by L. Carlitz and S. Uchiyama, is used in the S-box of Rijndael, which is chosen as the Advanced Encryption Standard. We complete the details of some theorem and proposition proofs given by Nyberg.
El, Rifai Ahmed Mahmoud. "Applications of linear block codes to the McEliece cryptosystem". Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/16604.
Texto completoKovacevic, Sanja. "SOVA based on a sectionalized trellis of linear block codes". Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=80115.
Texto completoThis thesis examines a new decoding scheme based on the soft-output Viterbi algorithm (SOVA) applied to a sectionalized trellis for linear block codes. The computational complexities of the new SOVA decoder and of the conventional SOVA decoder based on the bit-level trellis are theoretically analyzed and derived. These results are used to obtain the optimum sectionalization of a trellis for SOVA. The optimum sectionalization of a trellis for Maximum A Posteriori (MAP), Maximum Logarithm MAP (Max-Log-MAP), and Viterbi algorithms, and their corresponding computational complexities are included for comparisons. The results confirm that SOVA based on a sectionalized trellis is the most computationally efficient SISO decoder examined in this thesis.
The simulation results of the bit error rate (BER) over additive white Gaussian noise (AWGN) channel demonstrate that the BER performance of the new SOVA decoder is not degraded. The BER performance of SOVA used in a serially concatenated block codes scheme reveals that the soft outputs of the proposed decoder are the same as those of the conventional SOVA decoder. Iterative decoding of serially concatenated block codes reveals that the quality of reliability estimates of the proposed SOVA decoder is the same as that of the conventional SOVA decoder.
Chaudhari, Pragat. "Analytical Methods for the Performance Evaluation of Binary Linear Block Codes". Thesis, University of Waterloo, 2000. http://hdl.handle.net/10012/904.
Texto completoAl-Lawati, Haider. "Performance analysis of linear block codes over the queue-based channel". Thesis, Kingston, Ont. : [s.n.], 2007. http://hdl.handle.net/1974/652.
Texto completoGriffiths, Wayne Bradley. "On a posteriori probability decoding of linear block codes over discrete channels". University of Western Australia. School of Electrical, Electronic and Computer Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0156.
Texto completoFogarty, Neville Lyons. "On Skew-Constacyclic Codes". UKnowledge, 2016. http://uknowledge.uky.edu/math_etds/36.
Texto completoCollison, Sean Michael. "Extending the Dorsch decoder for efficient soft decision decoding of linear block codes". Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Thesis/Spring2009/s_collison_042309.pdf.
Texto completoTitle from PDF title page (viewed on May 21, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 64-65).
Weaver, Elizabeth A. "MINIMALITY AND DUALITY OF TAIL-BITING TRELLISES FOR LINEAR CODES". UKnowledge, 2012. http://uknowledge.uky.edu/math_etds/1.
Texto completoLibros sobre el tema "Linear block codes"
Lee, Chi Kong. Nonminimal trellises for linear block codes. Ottawa: National Library of Canada, 1996.
Buscar texto completoEiguren, Jakoba. Soft-decision decoding algorithms for linear block codes. Manchester: University of Manchester, 1994.
Buscar texto completoZhang, Song. Design of linear block codes with fixed state complexity. Ottawa: National Library of Canada, 1996.
Buscar texto completoLin, Shu. Trellises and trellis-based decoding algorithms for linear block codes. [Washington, DC: National Aeronautics and Space Administration, 1998.
Buscar texto completoLin, Shu, Tadao Kasami, Toru Fujiwara y Marc Fossorier. Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5745-6.
Texto completoLin, Shu. Trellises and trellis-based decoding algorithms for linear block codes. [Washington, DC: National Aeronautics and Space Administration, 1998.
Buscar texto completoLin, Shu. Trellises and trellis-based decoding algorithms for linear block codes. [Washington, DC: National Aeronautics and Space Administration, 1998.
Buscar texto completoMarc, Fossorier y United States. National Aeronautics and Space Administration., eds. Trellises and trellis-based decoding algorithms for linear block codes. [Washington, DC: National Aeronautics and Space Administration, 1998.
Buscar texto completo1937-, Lin Shu, ed. Trellises and trellis-based decoding algorithms for linear block codes. Boston: Kluwer Academic, 1998.
Buscar texto completoLin, Shu. Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Boston, MA: Springer US, 1998.
Buscar texto completoCapítulos de libros sobre el tema "Linear block codes"
Lin, Shu, Tadao Kasami, Toru Fujiwara y Marc Fossorier. "Linear Block Codes". En Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes, 5–22. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5745-6_2.
Texto completoRao, K. Deergha. "Linear Block Codes". En Channel Coding Techniques for Wireless Communications, 79–135. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-15-0561-4_4.
Texto completoLa Guardia, Giuliano Gadioli. "Linear Block Codes". En Quantum Error Correction, 43–56. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-48551-1_4.
Texto completoLe Ruyet, Didier y Mylène Pischella. "Linear Block Codes". En Digital Communications 1, 121–227. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2015. http://dx.doi.org/10.1002/9781119232421.ch3.
Texto completoGazi, Orhan. "Linear Block Codes". En Forward Error Correction via Channel Coding, 33–78. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-33380-5_2.
Texto completoReed, Irving S. y Xuemin Chen. "Linear Block Codes". En Error-Control Coding for Data Networks, 73–137. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5005-1_3.
Texto completoDeergha Rao, K. "Linear Block Codes". En Channel Coding Techniques for Wireless Communications, 73–126. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2292-7_4.
Texto completoIvaniš, Predrag y Dušan Drajić. "Trellis Decoding of Linear Block Codes, Turbo Codes". En Information Theory and Coding - Solved Problems, 385–446. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49370-1_8.
Texto completoLin, Shu, Tadao Kasami, Toru Fujiwara y Marc Fossorier. "Trellis Representation of Linear Block Codes". En Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes, 23–42. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5745-6_3.
Texto completoCancellieri, Giovanni. "Generator Matrix Approach to Linear Block Codes". En Polynomial Theory of Error Correcting Codes, 3–99. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-01727-3_1.
Texto completoActas de conferencias sobre el tema "Linear block codes"
Belabssir, S., N. Sahllal y El M. Souidi. "Cyclic linear error-block codes". En 2ND INTERNATIONAL CONFERENCE ON APPLIED MATHEMATICS, ICAM’2018. Author(s), 2019. http://dx.doi.org/10.1063/1.5090622.
Texto completoJian-Kang Zhang, Jing Liu y Kon Max Wong. "Linear toeplitz space time block codes". En Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523684.
Texto completoFarchane, Abderrazak y Mostafa Belkasmi. "New decoder for linear block codes". En 2016 International Conference on Advanced Communication Systems and Information Security (ACOSIS). IEEE, 2016. http://dx.doi.org/10.1109/acosis.2016.7843939.
Texto completoKora, A., J. P. Cances y V. Meghdadi. "Accurate Union-Bound for LDPC Block Codes Concatenated with Linear Dispersion Block Codes". En 2007 International Conference on Wireless Communications, Networking and Mobile Computing. IEEE, 2007. http://dx.doi.org/10.1109/wicom.2007.359.
Texto completoSandhu, Paulraj y Pandit. "On non-linear space-time block codes". En IEEE International Conference on Acoustics Speech and Signal Processing ICASSP-02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.1005172.
Texto completoSandhu, S., A. Paulraj y K. Pandit. "On non-linear space-time block codes". En Proceedings of ICASSP '02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.5745134.
Texto completoMahran, Ashraf. "Fast Kaneko Algorithm for Linear Block Codes". En 2019 7th International Japan-Africa Conference on Electronics, Communications, and Computations, (JAC-ECC). IEEE, 2019. http://dx.doi.org/10.1109/jac-ecc48896.2019.9051127.
Texto completoYardi, Arti, Vamshi Krishna Kancharla y Amrita Mishra. "Detecting Linear Block Codes via Deep Learning". En 2023 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2023. http://dx.doi.org/10.1109/wcnc55385.2023.10118805.
Texto completoKorada, Satish Babu, Shrinivas Kudekar y Nicolas Macris. "Concentration of magnetization for linear block codes". En 2008 IEEE International Symposium on Information Theory - ISIT. IEEE, 2008. http://dx.doi.org/10.1109/isit.2008.4595224.
Texto completoHan Vinck, A. J. y Yuan Luo. "Optimum distance profiles of linear block codes". En 2008 IEEE International Symposium on Information Theory - ISIT. IEEE, 2008. http://dx.doi.org/10.1109/isit.2008.4595331.
Texto completo