In 1999, a conference called International Meeting on Coding Theory and Cryptography took place at Mota Castle in Castilia (Spain). The conference had great acceptance within the community of coding theory and cryptography researchers. At that moment, and also nowadays, there are not many international workshops about these topics, at least if we compare with other mathematical and engineering subjects of research. Therefore, the general desire was to continue with more Castle Meetings. However, the following conference did not take place until 2008. In that case, the conference was called II International Castle Meeting on Coding Theory and Applications allowing more topics related to coding theory apart from cryptography. Such conference took place at Mota Castle again and the number of participants was similar to the previous edition. The present edition of the conference, called III International Castle Meeting on Coding Theory and Applications has been held at Cardona Castle in Catalonia (Spain). The number of communications has increased and a number of selected papers will be published in a special issue of the journal Designs, Codes and Cryptography. As in the previous editions, the conference has been of high level with notorious invited speakers and scientic committee members.
págs. 15-16
págs. 17-20
págs. 21-22
págs. 23-26
Carlos Araujo, Italo Dejter, Peter Horak
págs. 27-32
págs. 33-38
págs. 39-42
págs. 43-46
Information Sets in Abelian Codes:: Defining Sets and Groebner Basis
págs. 47-52
págs. 53-58
Binary Self-Dual Codes from 3-Class Association Schemes
Muhammad Bilal, Joaquim Borges Ayats, Steven T. Dougherty, Cristina Fernández Córdoba
págs. 59-64
págs. 65-70
págs. 71-74
págs. 75-80
págs. 81-86
A Construction of MDS Array Codes Based on Companion Matrices
Sara Díaz Cardell, Joan-Josep Climent Coloma, Verónica Requena Arévalo
págs. 87-92
Maximum Distance Separable 2D Convolutional Codes of Rate 1/n
María del Carmen Perea Marco, Joan-Josep Climent Coloma, Diego Napp Avelli, Raquel Pinto
págs. 93-98
págs. 99-104
págs. 105-110
Sub-Optimum Soft-Input Decoding of OMEC Codes
Jürgen Freudenberger, Farhad Ghaboussi
págs. 111-116
págs. 117-122
Group Codes which are not Abelian Group Codes
Cristina García Pillado, Santos González Jiménez, Victor Markov, Consuelo Martínez López, Alexander Nechaev
págs. 123-128
Quasi-Cyclic Minimum Bandwidth Regenerating Codes
Bernat Gastón Brasó, Jaume Pujol, M. Villanueva
págs. 129-134
págs. 135-142
A Note on Linear Programming Based Communication Receivers
Shunsuke Horii, Tota Suko, Toshiyasu Matsushima, Shigeichi Hirasawa
págs. 143-148
On MDS Convolutional Codes of Rate 1/n
José Ignacio Iglesias Curto, José María Muñoz Porras, Francisco José Plaza Martín, Gloria Serrano Sotelo
págs. 149-156
págs. 157-162
págs. 163-170
págs. 171-176
págs. 177-181
págs. 183-188
págs. 189-194
págs. 195-200
págs. 201-206
A Class of Repeated-Root Abelian Codes
Edgar Martínez Moro, Hakan Ozadam, Ferruh Özbudak, Steve Szabo
págs. 207-212
On the Permutation Automorphism Group of Quaternary Linear Hadamard Codes
Jaume Pernas Vallès, Jaume Pujol, M. Villanueva
págs. 213-218
págs. 219-224
págs. 225-232
On the Multidimensional Permanent and q-Ary Designs
Vladimir A. Potapov
págs. 233-238
Geometrically Uniform Quasi-Perteet Codes Derived from Graphs over Integer Rings
Catia Regina de Oliveira Quilles Queiroz, Reginaldo Palazzo Junior
págs. 239-244
GPT Cryptosystem for a Random Network Coding Channel
Haitham Rashwan, Nina I Pilipchuk, E.M. Gabidulin, Bahram Honary
págs. 245-252
On the Capacity of a Diseretized Gaussian Shift Channel
Eirik Rosnes, Angela Barbero Díez, Guang Yang, Oyvind Ytrehus
págs. 253-258
págs. 259-266
págs. 267-272
págs. 273-278
págs. 279-284
Discrete Logarithm Like Problems and Linear Recurring Sequences
Hugo Villafaite, Santos González Jiménez, Llorenç Huguet Rotger, Consuelo Martínez López
págs. 285-289
© 2001-2024 Fundación Dialnet · Todos los derechos reservados