Ayineedi Venkateswarlu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Sumit Kumar Pandey

> Home > Persons > Ayineedi Venkateswarlu

Publications

2021
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/KesarwaniPSV21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/KesarwaniPSV21
Abhishek Kesarwani, Sumit Kumar Pandey, Santanu Sarkar, Ayineedi Venkateswarlu:
Recursive MDS matrices over finite commutative rings. Discret. Appl. Math. 304: 384-396 (2021)
2019
[j13]
- view
  authority control:
- export record
  dblp key:
  - journals/dcc/GuptaPV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcc/GuptaPV19
Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu:
Almost involutory recursive MDS diffusion layers. Des. Codes Cryptogr. 87(2-3): 609-626 (2019)
2017
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/dcc/GuptaPV17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcc/GuptaPV17
Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu:
On the direct construction of recursive MDS matrices. Des. Codes Cryptogr. 82(1-2): 77-94 (2017)
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/dcc/GuptaPV17a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcc/GuptaPV17a
Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu:
Towards a general construction of recursive MDS diffusion layers. Des. Codes Cryptogr. 82(1-2): 179-195 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.