3rd International Castle Meeting on Coding Theory and Applications

Front Cover
Univ. AutÚnoma de Barcelona, 2011 - Education - 292 pages
0 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Table of Contents
11
Communications
26
A Proof of the MDS Conjecture over Prime Fields Simeon Ball
41
Binary Selfdual Codes from 3class Association Schemes Muhammad Bilal Joaquim Borges Steven T Dougherty and Cristina
58
On the GeilMatsumoto Bound Maria BrasAmoros and Albert VicoOton
73
Identifying Codes over Lgraphs Cristobal Camarero Carmen Martınez and Ramon Beivide
79
A Construction of MDS Array Codes Based on Companion Matrices Sara D Cardell JoanJosep Climent and Veronica Requena
85
Maximum Distance Separable 2D Convolutional Codes of Rate 1n JoanJosep Climent Diego Napp Carmen Perea and Raquel Pinto
92
A Note on xvt xvt1minihypers in PGt q
181
A Matrix Approach to Group Convolutional Codes
187
Classification of the Extremal Selfdual Codes with 2transitive Automorphism Groups
193
Evaluation of Publickey Cryptosystems Based on Algebraic Geometry Codes
199
A Class of Repeatedroot Abelian Codes
205
On the Permutation Automorphism Group of Quaternary Linear Hadamard Codes
211
Minimal Realizations of a 2D Convolutional Code of Rate 1n by Separable
217
On the Subfield Subcodes of Hermitian Codes
223

Classification of Linear Codes with Prescribed Minimum Distance and New Upper
103
Suboptimum Softinput Decoding of OMEC Codes Jurgen Freudenberger and Farhad Ghaboussi
109
Evaluation Codes Defined by Finite Families of Plane Valuations at Infinity Carlos Galindo and Francisco Monserrat
115
Group Codes which are not Abelian Group Codes Cristina Garcıa Pillado Santos Gonzalez Victor Markov Consuelo Martınez
122
Coding Strategies for Reliable Storage in Multilevel Flash Memories Kathryn Haymaker and Christine A Kelley
133
A Note on Linear Programming Based Communication Receivers Shunsuke Horii Tota Suko Toshiyasu Matsushima and Shigeichi Hirasawa
141
On MDS Convolutional Codes of Rate 1n Jose Ignacio Iglesias Curto Jose Marıa Munoz Porras Francisco Javier Plaza
147
Bounds on Collaborative Decoding of Interleaved Hermitian Codes with a Division
155
Improving Security of Niederreiter Type GPT Cryptosystem Based on Reducible
161
On the Automorphism Groups of the Additive 1perfect Binary Codes
169
Enumeration of Spectrum Shaped Binary Runlength Constrained Sequences
175
On the Multidimensional Permanent and qary Designs
231
Geometrically Uniform Quasiperfect Codes Derived from Graphs over Integer Rings
237
GPT Cryptosystem for a Random Network Coding Channel
243
On the Capacity of a Discretized Gaussian Shift Channel
251
Codes Associated with Circulant Graphs and Permutation Decoding
257
Fast Skewfeedback Shiftregister Synthesis
265
A Generalisation of the GilbertVarshamov Bound and its Asymptotic Evaluation
271
New Binary Codes From Extended Goppa Codes
277
Discrete Logarithm Like Problems and Linear Recurring Sequences
283
Author Index
289
Copyright

Common terms and phrases

Bibliographic information