Titlebook: Coding Theory and Applications; 2nd International Ca ángela Barbero Conference proceedings 2008 Springer-Verlag Berlin Heidelberg 2008 Alge

Gullet

書目名稱Coding Theory and Applications影響因子(影響力)




書目名稱Coding Theory and Applications影響因子(影響力)學科排名




書目名稱Coding Theory and Applications網(wǎng)絡(luò)公開度




書目名稱Coding Theory and Applications網(wǎng)絡(luò)公開度學科排名




書目名稱Coding Theory and Applications被引頻次




書目名稱Coding Theory and Applications被引頻次學科排名




書目名稱Coding Theory and Applications年度引用




書目名稱Coding Theory and Applications年度引用學科排名




書目名稱Coding Theory and Applications讀者反饋




書目名稱Coding Theory and Applications讀者反饋學科排名

aspersion

Inflamed

Charlatan

LIKEN

,On Rank and Kernel of ?4-Linear Codes,pper bounds, are established. For each possible rank . between these bounds, the construction of a ?.-linear code with rank . is given. Equivalently, for each possible dimension of the kernel ., the construction of a ?.-linear code with dimension of the kernel . is given.

Cacophonous

M. Guala,K. T. Christensen,R. J. Adriantely regular codes in Johnson graphs and other well-known mathematical problems. Some auxiliary theorems, which can be applied for treatment of perfect colorings in two colors in other graphs, are given in this paper.

Cacophonous

Turbulence Dynamics in a Two-Phase Flowwn algorithm for the decoding of Reed-Solomon codes (Peterson’s algorithm) uses syndromes. Now let . be a subset of . consisting of . distinct elements. We can see an RS-code of dimension .?≤?. as the set of all .-tuples that arise by evaluating all polynomial .(.) of degree less than or equal to .???1 in the points ..,...,...

impaction

Sedimentation as a Three-Component Systemrity against the attacks under study. We have shown by simulation results that our proposed optimization method has increased the security against node corruption considerably, and at the same time, the cost per level of security is lower compared to optimization methods without constraints on node corruption.

gimmick

Sedimentation as a Three-Component Systemunication system. Inductively coupled channels pose special challenges for building a secure system. We give a brief overview of these challenges, and of some cryptographic building blocks and protocols that have been proposed to meet them.

Cholagogue

Conference proceedings 2008astle in Medina del Campo. The event provided a forum for the exchange of results and ideas, which we hope will foster future collaboration. The ?rst meeting was held in 1999, and, encouraged by that experience, we now intend to hold the meeting every three years. Springer kindly accepted to publish