Relevant bibliographies by topics / Codes de permutations

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Codes de permutations'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Codes de permutations.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Codes de permutations"

1

Falcone, Giovanni, and Marco Pavone. "Binary Hamming codes and Boolean designs." Designs, Codes and Cryptography 89, no. 6 (2021): 1261–77. http://dx.doi.org/10.1007/s10623-021-00853-z.

Full text
Abstract:
AbstractIn this paper we consider a finite-dimensional vector space $${\mathcal {P}}$$ P over the Galois field $${\text {GF}}(2),$$ GF ( 2 ) , and the family $${\mathcal {B}}_k$$ B k (respectively, $${\mathcal {B}}_k^*$$ B k ∗ ) of all the k-sets of elements of $$\mathcal {P}$$ P (respectively, of $${\mathcal {P}}^*= {\mathcal {P}} \setminus \{0\}$$ P ∗ = P \ { 0 } ) summing up to zero. We compute the parameters of the 3-design $$({\mathcal {P}},{\mathcal {B}}_k)$$ ( P , B k ) for any (necessarily even) k, and of the 2-design $$({\mathcal {P}}^{*},{\mathcal {B}}_k^{*})$$ ( P ∗ , B k ∗ ) for an
APA, Harvard, Vancouver, ISO, and other styles
2

Buzaglo, Sarit, Eitan Yaakobi, Tuvi Etzion, and Jehoshua Bruck. "Systematic Error-Correcting Codes for Permutations and Multi-Permutations." IEEE Transactions on Information Theory 62, no. 6 (2016): 3113–24. http://dx.doi.org/10.1109/tit.2016.2543739.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Füredi, Zoltán, Ida Kantor, Angelo Monti, and Blerina Sinaimeri. "Reverse-free codes and permutations." Electronic Notes in Discrete Mathematics 38 (December 2011): 383–87. http://dx.doi.org/10.1016/j.endm.2011.09.062.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Füredi, Zoltan, Ida Kantor, Angelo Monti, and Blerina Sinaimeri. "On Reverse-Free Codes and Permutations." SIAM Journal on Discrete Mathematics 24, no. 3 (2010): 964–78. http://dx.doi.org/10.1137/090774835.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Han, Hui, Jianjun Mu, Xiaopeng Jiao, and Yu-Cheng He. "Codes Correcting a Burst of Deletions for Permutations and Multi-Permutations." IEEE Communications Letters 22, no. 10 (2018): 1968–71. http://dx.doi.org/10.1109/lcomm.2018.2859962.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fitzpatrick, Patrick, and John A. Ryan. "Counting irreducible Goppa codes." Journal of the Australian Mathematical Society 71, no. 3 (2001): 299–306. http://dx.doi.org/10.1017/s1446788700002949.

Full text
Abstract:
AbstractWe consider ineducible Goppa codes of length qm over Fq defined by polynomials of degree r, where q = pt and p, m, r are distinct primes. The number of such codes, inequivalent under coordinate permutations and field automorphisms, is determined.
APA, Harvard, Vancouver, ISO, and other styles
7

Berger, Thierry. "Groupes de permutations des codes mds affine-invariants." Communications in Algebra 21, no. 1 (1993): 239–54. http://dx.doi.org/10.1080/00927879208824558.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Keevash, Peter, and Eoin Long. "Frankl-Rödl-type theorems for codes and permutations." Transactions of the American Mathematical Society 369, no. 2 (2016): 1147–62. http://dx.doi.org/10.1090/tran/7015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dey, Bikash Kumar, and B. Sundar Rajan. "Codes Closed under Arbitrary Abelian Group of Permutations." SIAM Journal on Discrete Mathematics 18, no. 1 (2004): 1–18. http://dx.doi.org/10.1137/s0895480102416192.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kbaier Ben Ismail, D., S. Kerouédan, and C. Douillard. "Design of suitable permutations for irregular turbo codes." Electronics Letters 47, no. 13 (2011): 748–49. http://dx.doi.org/10.1049/el.2011.0990.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Codes de permutations"

1

Bogaerts, Mathieu. "Codes et tableaux de permutations, construction, énumération et automorphismes." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210302.

Full text
Abstract:
<p>Un code de permutations G(n,d) un sous-ensemble C de Sym(n) tel que la distance de Hamming D entre deux éléments de C est supérieure ou égale à d. Dans cette thèse, le groupe des isométries de (Sym(n),D) est déterminé et il est prouvé que ces isométries sont des automorphismes du schéma d'association induit sur Sym(n) par ses classes de conjugaison. Ceci mène, par programmation linéaire, à de nouveaux majorants de la taille maximale des G(n,d) pour n et d fixés et n compris entre 11 et 13. Des algorithmes de génération avec rejet d'objets isomorphes sont développés. Pour classer les G(n,d)
APA, Harvard, Vancouver, ISO, and other styles
2

Otmani, Ayoub. "Codes Cortex et construction de codes auto-duaux optimaux." Limoges, 2002. http://www.theses.fr/2002LIMO0039.

Full text
Abstract:
Nous étudions une famille de codes correcteurs d'erreurs nommés codes CORTEX. La construction repose sur l'utilisation de codes de base de petites longueurs de rendement 1/2 assemblés en couches entre lesquelles sont insérées des permutations. Il est prouvé que l'auto-dualité est conservée par cette construction. De plus, les codes CORTEX construits à partir du code de Hamming étendu de longueur 8 sont de type I (resp. Type II) si le nombre de permutations est impair (resp. Pair). Cette thèse consiste en l'étude de cette famille de codes afin de fournir une construction effective de codes opti
APA, Harvard, Vancouver, ISO, and other styles
3

Legeay, Matthieu. "Utilisation du groupe de permutations d'un code correcteur pour améliorer l'efficacité du décodage." Rennes 1, 2012. http://www.theses.fr/2012REN1S099.

Full text
Abstract:
Les codes correcteurs d'erreur et le problème lié de leur décodage constituent une des variantes envisagées en cryptographie post-quantique. De façon générale, un code aléatoire possède un groupe de permutations bien souvent trivial. Cependant, les codes impliqués dans la construction des cryptosystèmes et des fonctions cryptographiques basées sur les codes correcteurs possèdent généralement un groupe de permutations non-trivial. De plus, peu d'articles de cryptanalyse ne tiennent compte de l'information que représentent ces groupes de permutations. L'idée est donc d'utiliser le groupe de perm
APA, Harvard, Vancouver, ISO, and other styles
4

Peirani, Béatrice. "Cryptographie à base de codes correcteurs d'erreurs et générateurs aléatoires." Aix-Marseille 1, 1994. http://www.theses.fr/1994AIX11046.

Full text
Abstract:
Apres avoir rappele dans un premier chapitre les principales notions de codage et cryptographie, on donne un algorithme de chiffrement qui englobe les algorithmes de cryptographie standards utilisant des codes correcteurs d'erreurs (ceux de r. J. Mceliece (mc) et s. Harari (hal)), puis un cryptosysteme aleatoire avec feedback qui utilise un automate fini pour engendrer des permutations. Dans le chapitre suivant, une nouvelle famille de codes lineaires binaires correcteurs d'erreurs, dits en degrade, est introduite ; sa distance minimale est explicite et sa distribution de poids tend vers la lo
APA, Harvard, Vancouver, ISO, and other styles
5

Vernay, Rémi. "Etudes d'objets combinatoires : applications à la bio-informatique." Phd thesis, Université de Bourgogne, 2011. http://tel.archives-ouvertes.fr/tel-00668134.

Full text
Abstract:
Cette thèse porte sur des classes d'objets combinatoires, qui modélisent des données en bio-informatique. Nous étudions notamment deux méthodes de mutation des gènes à l'intérieur du génome : la duplication et l'inversion. Nous étudions d'une part le problème de la duplication-miroir complète avec perte aléatoire en termes de permutations à motifs exclus. Nous démontrons que la classe de permutations obtenue avec cette méthode après p duplications à partir de l'identité est la classe de permutations qui évite les permutations alternées de longueur 2p + 1. Nous énumérons également le nombre de
APA, Harvard, Vancouver, ISO, and other styles
6

Malakauskas, Vidmantas. "Kombinatorikos elementų generavimo algoritmų sudėtingumo tyrimas." Bachelor's thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100928_174038-29706.

Full text
Abstract:
Darbe tiriamas kėlinių, derinių, poaibių ir Grėjaus kodų generavimo algoritmų sudėtingumas. Atliekama algoritmų analizė. Tyrimo tikslams sukurta programa realizuojanti minėtus algoritmus.<br>The complexity research of permutations, combinations, subsets and Gray codes generating algorithms is provided in this paper. Algorithms are analyzed and implemented in the application developed for research purposes.
APA, Harvard, Vancouver, ISO, and other styles
7

Vernay, Rémi. "Étude d'objets combinatoires - Applications à la bio-informatique." Phd thesis, Université de Bourgogne, 2011. http://tel.archives-ouvertes.fr/tel-00618166.

Full text
Abstract:
Cette thèse porte sur des classes d'objets combinatoires, qui modélisent des données en bio-informatique. Nous étudions notamment deux méthodes de mutation des gènes à l'intérieur du génome : la duplication et l'inversion. Nous étudions d'une part le problème de la duplication-miroir complète avec perte aléatoire en termes de permutations à motifs exclus. Nous démontrons que la classe de permutations obtenue avec cette méthode après p duplications à partir de l'identité est la classe de permutations qui évite les permutations alternées de longueur 2^p+1. Nous énumérons également le nombre de d
APA, Harvard, Vancouver, ISO, and other styles
8

BREGA, LEONARDO SANTOS. "COMPRESSION USING PERMUTATION CODES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4379@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Em um sistema de comunicações, procura-se representar a informação gerada de forma eficiente, de modo que a redundância da informação seja reduzida ou idealmente eliminada, com o propósito de armazenamento e/ou transmissão da mesma. Este interesse justifica portanto, o estudo e desenvolvimento de técnicas de compressão que vem sendo realizado ao longo dos anos. Este trabalho de pesquisa investiga o uso de códigos de permutação para codificação de fontes segundo um critério de fidelidade, mais especificamente de fontes se
APA, Harvard, Vancouver, ISO, and other styles
9

Nguyen, Ha Quy. "Generalizations of permutation source codes." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/54652.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 87-90).<br>Permutation source codes are a class of structured vector quantizers with a computationally- simple encoding procedure. In this thesis, we provide two extensions that preserve the computational simplicity but yield improved operational rate-distortion performance. In the first approach, the new class of vector quantizers has a codebook comprising several permutation codes as subcodes. Met
APA, Harvard, Vancouver, ISO, and other styles
10

SILVA, DANILO. "PERMUTATION CODES FOR DATA COMPRESSION AND MODULATION." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6202@1.

Full text
Abstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Códigos de permutação são uma interessante ferramenta matemática que pode ser empregada para construir tanto esquemas de compressão com perdas quanto esquemas de modulação em um sistema de transmissão digital. Códigos de permutação vetorial, uma extensão mais poderosa dos códigos de permutação escalar, foram recentemente introduzidos no contexto de compressão de fontes. Este trabalho apresenta novas contribuições a essa teoria e introduz os códigos de permutação vetorial no contexto de modulação. Para compressão de fonte
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Codes de permutations"

1

Trifina, Lucian, and Daniela Tarniceriu. Permutation Polynomial Interleavers for Turbo Codes. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-2625-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wilson, Robin. Combinatorics: A Very Short Introduction. Oxford University Press, 2016. http://dx.doi.org/10.1093/actrade/9780198723493.001.0001.

Full text
Abstract:
Combinatorics is the branch of mathematics concerned with selecting, arranging, and listing or counting collections of objects. Dating back some 3000 years, and initially consisting mainly of the study of permutations and combinations, its scope has broadened to include topics such as graph theory, partitions of numbers, block designs, design of codes, and latin squares. Combinatorics: A Very Short Introduction provides an overview of the field and its applications in mathematics and computer theory, considering problems from the shortest routes covering certain stops to the minimum number of
APA, Harvard, Vancouver, ISO, and other styles
3

Trifina, Lucian, and Daniela Tarniceriu. Permutation Polynomial Interleavers for Turbo Codes. Springer, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Trifina, Lucian, and Daniela Tarniceriu. Permutation Polynomial Interleavers for Turbo Codes. Springer, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Codes de permutations"

1

Bierbrauer, Jürgen, Stephen Black, and Yves Edel. "Some t-Homogeneous Sets of Permutations." In Codes, Designs and Geometry. Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1423-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mesnager, Sihem, Pınar Ongan, and Ferruh Özbudak. "New Bent Functions from Permutations and Linear Translators." In Codes, Cryptology and Information Security. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55589-8_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Agrawal, Shashank, Divya Gupta, Hemanta K. Maji, Omkant Pandey, and Manoj Prabhakaran. "Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47989-6_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Laigle-Chapuy, Yann. "A Note on a Class of Quadratic Permutations over ${\mathbb F}_{{2^n}}$." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-77224-8_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ahlswede, Rudolf. "Codes Produced by Permutations: The Link Between Source and Channel Coding." In Foundations in Signal Processing, Communications and Networking. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53139-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kreshchuk, Alexey, Igor Zhilin, and Victor Zyablov. "On the Performance of Block Woven Codes Constructions with Row-Wise Permutations." In Coding Theory and Applications. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66278-7_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Zhe, Chaoping Xing, and Sze Ling Yeo. "Reducing the Key Size of McEliece Cryptosystem from Automorphism-induced Goppa Codes via Permutations." In Public-Key Cryptography – PKC 2019. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-17259-6_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Agrawal, Shashank, Divya Gupta, Hemanta K. Maji, Omkant Pandey, and Manoj Prabhakaran. "A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations." In Theory of Cryptography. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-46494-6_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Trifina, Lucian, and Daniela Tarniceriu. "Fundamentals of Turbo Codes." In Permutation Polynomial Interleavers for Turbo Codes. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-2625-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Trifina, Lucian, and Daniela Tarniceriu. "Introduction." In Permutation Polynomial Interleavers for Turbo Codes. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-2625-7_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Codes de permutations"

1

Borysenko, A. A., O. Y. Horiachev, S. M. Matsenko, and O. M. Kobiakov. "Noise-immune codes based on permutations." In 2018 IEEE 9th International Conference on Dependable Systems, Services and Technologies (DESSERT). IEEE, 2018. http://dx.doi.org/10.1109/dessert.2018.8409204.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bioglio, Valerio, and Ingmar Land. "Polar codes with internal edge permutations." In 2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW). IEEE, 2018. http://dx.doi.org/10.1109/wcncw.2018.8369014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gabrys, Ryan, Eitan Yaakobi, Farzad Farnoud, Frederic Sala, Jehoshua Bruck, and Lara Dolecek. "Single-deletion-correcting codes over permutations." In 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6875337.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Barg, Alexander, and Arya Mazumdar. "Codes in permutations and error correction for rank modulation." In 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513604.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hashemi, Seyyed Ali, Nghia Doan, Marco Mondelli, and Warren J. Gross. "Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations." In 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC). IEEE, 2018. http://dx.doi.org/10.1109/istc.2018.8625281.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Berrou, C., Y. Saouter, C. Douillard, S. Kerouedan, and M. Jezequel. "Designing good permutations for turbo codes: towards a single model." In 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577). IEEE, 2004. http://dx.doi.org/10.1109/icc.2004.1312507.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gabrys, Ryan, and Olgica Milenkovic. "Balanced permutation codes." In 2016 IEEE International Symposium on Information Theory (ISIT). IEEE, 2016. http://dx.doi.org/10.1109/isit.2016.7541327.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Balado, Felix, and David Haughton. "Permutation codes and steganography." In ICASSP 2013 - 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2013. http://dx.doi.org/10.1109/icassp.2013.6638199.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yoshida, Ryoichiro, and Kenta Kasai. "Linear Permutation Polynomial Codes." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849422.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Barta, Janos, and Roberto Montemanni. "Hamming Graphs and Permutation Codes." In 2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI). IEEE, 2017. http://dx.doi.org/10.1109/mcsi.2017.35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography