Titlebook: Eurocode ’92; International Sympos P. Camion,P. Charpin,S. Harari Book 1993 Springer-Verlag Wien 1993 algebra.algorithms.coding.coding theo

悲傷我

書目名稱Eurocode ’92影響因子(影響力)




書目名稱Eurocode ’92影響因子(影響力)學(xué)科排名




書目名稱Eurocode ’92網(wǎng)絡(luò)公開度




書目名稱Eurocode ’92網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Eurocode ’92被引頻次




書目名稱Eurocode ’92被引頻次學(xué)科排名




書目名稱Eurocode ’92年度引用




書目名稱Eurocode ’92年度引用學(xué)科排名




書目名稱Eurocode ’92讀者反饋




書目名稱Eurocode ’92讀者反饋學(xué)科排名

過(guò)度

易改變

goodwill

Construction of the Best Binary Cyclic Codes of Even Lengthtablish the set of the minimal distances reached by even length codes, and for each of these distances, to determine the associated generator polynomial of lowest degree. Thanks to this result we construct the complete table of the best possible binary cyclic codes on each minimal distance up to the

殺蟲劑

Weights of Primitive Binary Cyclic Codes from Non-Primitive Codese k over ... We consider N the binary cyclic code C of length N = 2. ?1, generated by.. For special cases, we determine the weights of C by using the weights of the irreducible cyclic code of length s, generated by..

Ibd810

Boolean Functions on Finite Fields of Characteristic 2 ways to obtain them, and characterize them as the solutions of a differential equation. We prove that their derivatives are the squares of those polynomials which are invariant under a certain transformation that we introduce, and deduce a result on BCH codes. Eventually, we use them to solve some

Ibd810

MILL

On Generalized Bent Functionsnons une majoration du rayon de recouvrement des codes de Reed-Muller affines construits sur des anneaux finis et commutatifs. Une majoration du degré des fonctions courbes généralisées termine l’article.

Intellectual

Bounds for Self-Complementary Codes and Their Applicationshe size of a self-complementary code with a given minimum distance . presented here is in general better than the corresponding bound for arbitrary binary codes in the Hamming space. Some applications of this bound for estimating the minimum distance of self-dual binary codes, the cross-correlation

虛假