default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 101 matches
- 2022
- Jesús Fuentes, Octavio Obregón:
Optimisation of information processes using non-extensive entropies without parameters. Int. J. Inf. Coding Theory 6(1): 35-51 (2022) - Xiangrui Meng, Vidya Sagar, Ritumoni Sarma:
Codes with low-dimensional hull. Int. J. Inf. Coding Theory 6(1): 71-86 (2022) - Song Chol Pak, Nam Chol Yu:
A new burst error correcting method for Reed-Solomon codes based on composite parity-check matrices. Int. J. Inf. Coding Theory 6(1): 22-34 (2022) - Om Prakash, Shikha Yadav, Priyanka Sharma:
Reversible cyclic codes over a class of chain rings and their application to DNA codes. Int. J. Inf. Coding Theory 6(1): 52-70 (2022) - Arti D. Yardi:
Third-party cyclic code reconstruction over binary erasure channel. Int. J. Inf. Coding Theory 6(1): 1-21 (2022) - 2020
- Selda Çalkavur, Syed Khalid Nauman, Cenap Özel, Hanifa Zekraoui:
The least-squares solutions in linear codes based multisecret-sharing approach. Int. J. Inf. Coding Theory 5(3/4): 290-302 (2020) - Ratna Chakrabarty, Shuvadip Sutradhar, Sayanti Jana, Argho Dutta, Niranjan Kumar Mandal:
Design of convolution encoder using quantum dot cellular automata. Int. J. Inf. Coding Theory 5(3/4): 227-238 (2020) - Steven T. Dougherty, Joe Gildea, Adrian Korban, Abidin Kaya:
New extremal self-dual binary codes of length 68 via composite construction, 2 + u2 lifts, extensions and neighbours. Int. J. Inf. Coding Theory 5(3/4): 211-226 (2020) - Steven T. Dougherty, Bahattin Yildiz:
Linear transformation codes: codes with a compact description and transpoliser codes. Int. J. Inf. Coding Theory 5(3/4): 185-197 (2020) - Habibul Islam, Ram Krishna Verma, Om Prakash:
A family of constacyclic codes over pm [υ, w]/〈υ2 - 1, w2 - 1, υw - wυ〉. Int. J. Inf. Coding Theory 5(3/4): 198-210 (2020) - Shikha Patel, Om Prakash:
Repeated-root bidimensional (μ, ν)-constacyclic codes of length 4pt.2r. Int. J. Inf. Coding Theory 5(3/4): 266-289 (2020) - Eduardo Brandani da Silva, Emerson Vitor Castelani, Maycow Gonçalves Carneiro:
New quasi-cyclic codes from finite upper half-planes. Int. J. Inf. Coding Theory 5(3/4): 239-265 (2020) - 2018
- Emanuele Bellini, Massimiliano Sala:
A deterministic algorithm for the distance and weight distribution of binary nonlinear codes. Int. J. Inf. Coding Theory 5(1): 18-35 (2018) - Reza Dastbasteh, Seyed Hamed Mousavi, Taher Abualrub, Nuh Aydin, Javad Haghighat:
Skew cyclic codes over p + up. Int. J. Inf. Coding Theory 5(1): 81-99 (2018) - Lingyu Diao, Jian Gao:
ℤpℤp[u]-additive cyclic codes. Int. J. Inf. Coding Theory 5(1): 1-17 (2018) - Xin Gao:
An iterative decoding scheme on random burst error correction with Reed-Solomon codes. Int. J. Inf. Coding Theory 5(2): 117-129 (2018) - Mokshi Goyal, Madhu Raka:
Duadic and triadic codes over a finite non-chain ring and their Gray images. Int. J. Inf. Coding Theory 5(1): 36-54 (2018) - Ted Hurley, Donny Hurley:
Coding theory: the unit-derived methodology. Int. J. Inf. Coding Theory 5(1): 55-80 (2018) - Ted Hurley, Donny Hurley, Barry Hurley:
Quantum error-correcting codes: the unit design strategy. Int. J. Inf. Coding Theory 5(2): 169-182 (2018) - Habibul Islam, Om Prakash:
Skew cyclic and skew (α1 + uα2 + vα3 + uvα4)-constacyclic codes over Fq + uFq + vFq + uvFq. Int. J. Inf. Coding Theory 5(2): 101-116 (2018) - Habibul Islam, Om Prakash:
A study of cyclic and constacyclic codes over Z4 + uZ4 + vZ4. Int. J. Inf. Coding Theory 5(2): 155-168 (2018) - Yongkang Wang, Jian Gao:
Constacyclic codes over the ring Fp + vFp and their applications of constructing new non-binary quantum codes. Int. J. Inf. Coding Theory 5(2): 130-141 (2018) - Bahattin Yildiz, Abidin Kaya:
Self-dual codes over Z4[x]/(x2 + 2x) and the Z4-images. Int. J. Inf. Coding Theory 5(2): 142-154 (2018) - 2017
- Srinivasulu Bathala, Maheshanand Bhaintwal:
The structure of duals of cyclic codes over 2 + u2 + v2 + uv2 and some DNA codes. Int. J. Inf. Coding Theory 4(1): 79-100 (2017) - Pierre-Louis Cayrel, Mbouye Khady Diagne, Cheikh Thiécoumba Gueye:
NP-completeness of the Goppa parameterised random binary quasi-dyadic syndrome decoding problem. Int. J. Inf. Coding Theory 4(4): 276-288 (2017) - Pascale Charpin, Gohar M. Kyureghyan:
On sets determining the differential spectrum of mappings. Int. J. Inf. Coding Theory 4(2/3): 170-184 (2017) - Steven T. Dougherty, Jon-Lark Kim, Buket Özkaya, Lin Sok, Patrick Solé:
The combinatorics of LCD codes: linear programming bound and orthogonal matrices. Int. J. Inf. Coding Theory 4(2/3): 116-128 (2017) - Tuvi Etzion:
Regular graphs with forbidden subgraphs of Kn with k edges. Int. J. Inf. Coding Theory 4(2/3): 145-158 (2017) - Magnus Gausdal Find, Daniel Smith-Tone, Meltem Sönmez Turan:
The number of boolean functions with multiplicative complexity 2. Int. J. Inf. Coding Theory 4(4): 222-236 (2017) - Jean-Pierre Flori, Gérard D. Cohen:
On a generalised combinatorial conjecture involving addition mod 2k - 1. Int. J. Inf. Coding Theory 4(2/3): 107-115 (2017)
skipping 71 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-06 03:04 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint