Algorithm for compressing/decompressing Sudoku grids

dc.contributor.author	Nedev, Zhivko
dc.contributor.author	Zungeru, Adamu Murtala
dc.contributor.author	Khov, Suykhun
dc.contributor.author	Dy, Daravisal
dc.contributor.author	Sov, Kimkhung
dc.date.accessioned	2021-09-28T12:09:44Z
dc.date.available	2021-09-28T12:09:44Z
dc.date.issued	2020-11
dc.identifier.citation	Nedev, Z. et al (2020) Algorithm for compressing/decompressing Sudoku grids. Journal of Computer Science, 16 (9), 1319-1324. https://doi.org/10.3844/jcssp.2020.1319.1324	en_US
dc.identifier.issn	1549-3636
dc.identifier.issn	1552-6607
dc.identifier.uri	http://repository.biust.ac.bw/handle/123456789/356
dc.description.abstract	We describe a way to transfer efficiently Sudoku grids through the Internet. This is done by using linearization together with compression and decompression that use the information structure present in all sudoku grids. The compression and the corresponding decompression are based on the fact that in each Sudoku grid there are information dependencies and so some of the information is redundant.	en_US
dc.language.iso	en	en_US
dc.publisher	Science publications	en_US
dc.subject	Sudoku	en_US
dc.subject	Compression	en_US
dc.subject	Decompression	en_US
dc.subject	Algorithms	en_US
dc.subject	Data Structure	en_US
dc.title	Algorithm for compressing/decompressing Sudoku grids	en_US
dc.description.level	phd	en_US
dc.description.accessibility	unrestricted	en_US
dc.description.department	cse	en_US

Files in this item

Name: Nedev_JCS_2020.pdf

Size: 673.5Kb

Format: PDF

Faculty of Sciences
This collection is made up of pre and post research articles created by both staff and students from Faculty of Sciences