{"id":"https://openalex.org/W1977084559","doi":"https://doi.org/10.1109/icacci.2014.6968499","title":"Secure code assignment to alphabets using modified ant colony optimization along with compression","display_name":"Secure code assignment to alphabets using modified ant colony optimization along with compression","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W1977084559","doi":"https://doi.org/10.1109/icacci.2014.6968499","mag":"1977084559"},"language":"en","primary_location":{"id":"doi:10.1109/icacci.2014.6968499","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2014.6968499","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043668739","display_name":"Hitesh Hasija","orcid":null},"institutions":[{"id":"https://openalex.org/I863896202","display_name":"Delhi Technological University","ror":"https://ror.org/01ztcvt22","country_code":"IN","type":"education","lineage":["https://openalex.org/I863896202"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Hitesh Hasija","raw_affiliation_strings":["Information Technology, Delhi Technological University, Delhi, India","Information Technology, Delhi Technological University, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Technology, Delhi Technological University, Delhi, India","institution_ids":["https://openalex.org/I863896202"]},{"raw_affiliation_string":"Information Technology, Delhi Technological University, India","institution_ids":["https://openalex.org/I863896202"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064570061","display_name":"Rahul Katarya","orcid":"https://orcid.org/0000-0001-7763-291X"},"institutions":[{"id":"https://openalex.org/I863896202","display_name":"Delhi Technological University","ror":"https://ror.org/01ztcvt22","country_code":"IN","type":"education","lineage":["https://openalex.org/I863896202"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rahul Katarya","raw_affiliation_strings":["Information Technology, Delhi Technological University, Delhi, India","Information Technology, Delhi Technological University, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Technology, Delhi Technological University, Delhi, India","institution_ids":["https://openalex.org/I863896202"]},{"raw_affiliation_string":"Information Technology, Delhi Technological University, India","institution_ids":["https://openalex.org/I863896202"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4229,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.73434066,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"175","last_page":"181"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11017","display_name":"Chaos-based Image/Signal Encryption","score":0.9767000079154968,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9613999724388123,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ascii","display_name":"ASCII","score":0.7743051648139954},{"id":"https://openalex.org/keywords/plain-text","display_name":"Plain text","score":0.7207851409912109},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7083288431167603},{"id":"https://openalex.org/keywords/plaintext","display_name":"Plaintext","score":0.613229513168335},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.5965332388877869},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5898287296295166},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.5810045599937439},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.46654605865478516},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46613356471061707},{"id":"https://openalex.org/keywords/ciphertext","display_name":"Ciphertext","score":0.45876210927963257},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4505211114883423},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.4472075402736664},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.365911066532135},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15352275967597961},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1282455325126648}],"concepts":[{"id":"https://openalex.org/C196832560","wikidata":"https://www.wikidata.org/wiki/Q8815","display_name":"ASCII","level":2,"score":0.7743051648139954},{"id":"https://openalex.org/C46503548","wikidata":"https://www.wikidata.org/wiki/Q1145976","display_name":"Plain text","level":3,"score":0.7207851409912109},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7083288431167603},{"id":"https://openalex.org/C92717368","wikidata":"https://www.wikidata.org/wiki/Q1162538","display_name":"Plaintext","level":3,"score":0.613229513168335},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.5965332388877869},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5898287296295166},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.5810045599937439},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.46654605865478516},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46613356471061707},{"id":"https://openalex.org/C93974786","wikidata":"https://www.wikidata.org/wiki/Q1589480","display_name":"Ciphertext","level":3,"score":0.45876210927963257},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4505211114883423},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4472075402736664},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.365911066532135},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15352275967597961},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1282455325126648},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icacci.2014.6968499","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2014.6968499","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W2002034216","https://openalex.org/W2002602065","https://openalex.org/W2028150332","https://openalex.org/W2108944341","https://openalex.org/W2123019706","https://openalex.org/W2126071590","https://openalex.org/W2133562511","https://openalex.org/W2140024209","https://openalex.org/W2155644445","https://openalex.org/W2185351585","https://openalex.org/W2487705751","https://openalex.org/W2552721378"],"related_works":["https://openalex.org/W3015562301","https://openalex.org/W2103264672","https://openalex.org/W2130546408","https://openalex.org/W2997530193","https://openalex.org/W4310649982","https://openalex.org/W2942137924","https://openalex.org/W2778275754","https://openalex.org/W4236344152","https://openalex.org/W2011667854","https://openalex.org/W2802117553"],"abstract_inverted_index":{"Assigning":[0],"ASCII":[1,20],"values":[2,121],"to":[3,42,66,126,134],"the":[4,19,35,72,110],"plaintext":[5],"alphabets":[6,78,117],"during":[7],"transmission":[8],"of":[9,22,28,63,74,76,128],"documents":[10],"is":[11,24,55],"very":[12,56],"common,":[13],"and":[14,53],"as":[15,40],"we":[16],"know":[17],"that":[18,27,45,90,109,127],"value":[21],"`a'":[23],"less":[25],"than":[26],"`z'.":[29],"But,":[30],"what":[31],"would":[32],"happen":[33],"if":[34],"document":[36],"contains":[37],"more":[38,148],"`z'":[39],"compared":[41],"`a'.":[43],"In":[44],"case,":[46],"achieving":[47],"security":[48,91],"through":[49],"encryption":[50,106],"-":[51],"decryption":[52],"compression":[54,136],"difficult.":[57],"This":[58],"paper":[59,147],"proposes":[60],"a":[61,104],"technique":[62],"assigning":[64],"codes":[65,99],"plain":[67,129],"text":[68,112,130],"alphabets,":[69,131],"based":[70],"on":[71],"frequency":[73],"occurrences":[75],"those":[77,116],"by":[79],"using":[80],"ant":[81],"colony":[82],"optimization":[83],"with":[84],"roulette":[85],"wheel":[86],"selection":[87],"algorithm,":[88],"so":[89],"in":[92,132],"code":[93,120],"generation":[94],"could":[95],"be":[96],"achieved.":[97],"Obtained":[98],"are":[100,122],"then":[101],"applied":[102],"over":[103],"particular":[105],"algorithm":[107],"such":[108],"cipher":[111],"generated":[113],"should":[114],"contain":[115],"only":[118],"whose":[119],"near":[123],"about":[124],"similar":[125],"order":[133],"achieve":[135],"simultaneously.":[137],"Getting":[138],"all":[139],"this":[140,146],"within":[141],"specified":[142],"time":[143],"constraint":[144],"makes":[145],"impressive.":[149]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}