default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaligram G. S. Shiva
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1986
[j19]Anader Benyamin-Seeyar, Saligram G. S. Shiva, Vijay K. Bhargava:
Capability of the error-trapping technique in decoding cyclic codes. IEEE Trans. Inf. Theory 32(2): 166-180 (1986)- 1984
- [j18]J. F. Huang, Saligram G. S. Shiva, Gérald E. Séguin:
On certain projective geometry codes. IEEE Trans. Inf. Theory 30(2): 385-388 (1984) - 1981
- [j17]C. V. Chakravarthy, Nicolas D. Georganas, Saligram G. S. Shiva:
An Incremental Adaptive Quantizer: A Novel Quantization Scheme. IEEE Trans. Commun. 29(7): 1056-1061 (1981) - [j16]Saligram G. S. Shiva, Paul E. Allard, Gérald E. Séguin:
A class of composite codes. IEEE Trans. Inf. Theory 27(2): 260-262 (1981)
1970 – 1979
- 1978
- [j15]Nicolas D. Georganas, Saligram G. S. Shiva, Pramode K. Verma, J. S. Jawanda:
Evaluation of the Mean Error-Free Interval of a Noisy Data Channel. IEEE Trans. Commun. 26(1): 185-187 (1978) - 1974
- [j14]Vijay K. Bhargava, Stafford E. Tavares, Saligram G. S. Shiva:
Difference Sets of the Hadamard Type and Quasi-Cyclic Codes. Inf. Control. 26(4): 341-350 (1974) - [j13]Saligram G. S. Shiva, Stafford E. Tavares:
On binary majority-logic decodable codes (Corresp.). IEEE Trans. Inf. Theory 20(1): 131-133 (1974) - [j12]Stafford E. Tavares, Vijay K. Bhargava, Saligram G. S. Shiva:
Some rate- p/(p+1) quasi-cyclic codes (Corresp.). IEEE Trans. Inf. Theory 20(1): 133-135 (1974) - 1973
- [j11]Paul E. Allard, Saligram G. S. Shiva, Stafford E. Tavares:
A Note on the Decomposition of Cyclic Codes into Cyclic Classes. Inf. Control. 22(1): 100-106 (1973) - 1972
- [j10]Saligram G. S. Shiva, K. C. Fung:
Permutation decoding of certain triple-error-correcting binary codes (Corresp.). IEEE Trans. Inf. Theory 18(3): 444-446 (1972) - 1971
- [j9]Stafford E. Tavares, Paul E. Allard, Saligram G. S. Shiva:
On the Decomposition of Cyclic Codes into Cyclic Classes. Inf. Control. 18(4): 342-354 (1971) - [j8]Shanker Singh, Saligram G. S. Shiva:
Asynchronous Unit Delays. IEEE Trans. Computers 20(5): 493-499 (1971) - 1970
- [j7]Saligram G. S. Shiva, Paul E. Allard:
A few useful details about a known technique for factoring 1+X2q-1 (Corresp.). IEEE Trans. Inf. Theory 16(2): 234-235 (1970) - [j6]Saligram G. S. Shiva, Gérald E. Séguin:
Synchronizable error-correcting binary codes (Corresp.). IEEE Trans. Inf. Theory 16(2): 241-242 (1970) - [j5]Saligram G. S. Shiva, K. C. Fung, H. S. Y. Tan:
On permutation decoding of binary cyclic double-error-correcting codes of certain lengths (Corresp.). IEEE Trans. Inf. Theory 16(5): 641-643 (1970) - [j4]Stafford E. Tavares, Saligram G. S. Shiva:
Detecting and correcting multiple bursts for binary cyclic codes (Corresp.). IEEE Trans. Inf. Theory 16(5): 643-644 (1970)
1960 – 1969
- 1969
- [j3]Saligram G. S. Shiva, C. Sheng:
Multiple solid burst-error-correcting binary codes (Corresp.). IEEE Trans. Inf. Theory 15(1): 188-189 (1969) - [j2]Saligram G. S. Shiva:
Some results on binary codes with equidistant words (Corresp.). IEEE Trans. Inf. Theory 15(2): 328-329 (1969) - [j1]Saligram G. S. Shiva, Tony Zeitoun:
Decoding of binary cyclic burst-error-correcting codes (Corresp.). IEEE Trans. Inf. Theory 15(6): 737 (1969)
Coauthor Index
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.
last updated on 2025-01-09 12:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
